关注
Tarmo Uustalu
Tarmo Uustalu
Professor, Reykjavik University / Lead research scientist, Tallinn University of Technology
在 ru.is 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Monads need not be endofunctors
T Altenkirch, J Chapman, T Uustalu
Logical Methods in Computer Science 11 (1), 2015
2022015
Type-based termination of recursive definitions
G Barthe, MJ Frade, E Giménez, L Pinto, T Uustalu
Mathematical Structures in Computer Science 14 (1), 97-141, 2004
1412004
Comonadic notions of computation
T Uustalu, V Vene
Electronic Notes in Theoretical Computer Science 203 (5), 263-284, 2008
1292008
The essence of dataflow programming
T Uustalu, V Vene
Central European Functional Programming School, 135-167, 2006
1142006
The essence of dataflow programming
T Uustalu, V Vene
Asian Symposium on Programming Language and Systems, 2-18, 2005
1142005
Primitive (co) recursion and course-of-value (co) iteration, categorically
T Uustalu, V Vene
Informatica 10 (1), 5-26, 1999
1061999
Combining effects and coeffects via grading
M Gaboardi, S Katsumata, D Orchard, F Breuvart, T Uustalu
ACM SIGPLAN Notices 51 (9), 476-489, 2016
1002016
Recursive coalgebras from comonads
V Capretta, T Uustalu, V Vene
Information and Computation 204 (4), 437-468, 2006
742006
Recursion schemes from comonads
T Uustalu, V Vene, A Pardo
Nordic Journal of Computing 8 (3), 366-390, 2001
742001
Iteration and coiteration schemes for higher-order and nested datatypes
A Abel, R Matthes, T Uustalu
Theoretical Computer Science 333 (1-2), 3-66, 2005
732005
Functional programming with apomorphisms (corecursion)
V Vene, T Uustalu
Proceedings of the Estonian Academy of Sciences: Physics, Mathematics 47 (3 …, 1998
621998
Trace-based coinductive operational semantics for While
K Nakata, T Uustalu
Theorem Proving in Higher Order Logics, 375-390, 2009
59*2009
Proof search and counter-model construction for bi-intuitionistic propositional logic with labelled sequents
L Pinto, T Uustalu
Automated Reasoning with Analytic Tableaux and Related Methods, 295-309, 2009
542009
A Hoare logic for the coinductive trace-based big-step semantics of While
K Nakata, T Uustalu
Logical Methods in Computer Science 11 (1), 2015
482015
Resumptions, weak bisimilarity and big-step semantics for While with interactive I/O: An exercise in mixed induction-coinduction
K Nakata, T Uustalu
EPTCS 32, 57-75, 2010
462010
Corecursive algebras: A study of general structured corecursion
V Capretta, T Uustalu, V Vene
Brazilian Symposium on Formal Methods, 84-100, 2009
432009
Substitution in non-wellfounded syntax with variable binding
R Matthes, T Uustalu
Theoretical Computer Science 327 (1-2), 155-174, 2004
432004
Generalizing substitution
T Uustalu
RAIRO-Theoretical Informatics and Applications 37 (4), 315-336, 2003
422003
Mendler-style inductive types, categorically
T Uustalu, V Vene
Nordic Journal of Computing 6 (3), 343-361, 1999
411999
CPS translating inductive and coinductive types
G Barthe, T Uustalu
Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and …, 2002
382002
系统目前无法执行此操作，请稍后再试。
文章 1–20