Tarmo Uustalu

Cited by

	All	Since 2019
Citations	2934	1033
h-index	30	16
i10-index	74	36

240

120

180

199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202410 7 6 12 9 10 6 18 22 38 43 53 90 79 80 110 97 138 120 170 151 130 135 163 170 143 160 170 192 223 143

Public access

View all

18 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Varmo VeneProfessor of Semantics of Programming Languages, University of TartuVerified email at cs.ut.ee
Luís PintoCentro de Matemática and Departamento de Matemática e Aplicações, Universidade do MinhoVerified email at math.uminho.pt
Niccolò VeltriResearcher, Department of Software Science, Tallinn University of TechnologyVerified email at cs.ioc.ee
James ChapmanIOG (IOHK)Verified email at iohk.io
Ando SaabasMicrosoftVerified email at set.ee
Thorsten AltenkirchProfessor of Computer Science, University of NottinghamVerified email at cs.nott.ac.uk
Danel AhmanInstitute of Computer Science, University of TartuVerified email at ut.ee
Keiko NakataSAP SEVerified email at cs.ioc.ee
Denis FirsovResearcher at Matter Labs and Tallinn University of TechnologyVerified email at cs.ioc.ee
Ralph MatthesCNRS, IRIT, Toulouse, FranceVerified email at irit.fr
Venanzio CaprettaNottingham UniversityVerified email at duplavis.com
Dylan McDermottReykjavik UniversityVerified email at ru.is
Noam ZeilbergerEcole PolytechniqueVerified email at lix.polytechnique.fr
Maria João FradeHASLab / INESC TEC and Universidade do MinhoVerified email at di.uminho.pt
Gilles BartheMPI-SP and IMDEA Software InstituteVerified email at mpi-sp.org
Andreas AbelSenior Lecturer at the Department of Computer Science and Engineering, Gothenburg UniversityVerified email at gu.se
Alberto PardoProfessor of Computer Science, Instituto de Computacion, Universidad de la Republica, UruguayVerified email at fing.edu.uy
Hendrik MaarandTallinn University of TechnologyVerified email at cs.ioc.ee
Dominic OrchardSchool of Computing, University of Kent and Computer Laboratory, University of CambridgeVerified email at kent.ac.uk
Marco GaboardiBoston UniversityVerified email at bu.edu

Tarmo Uustalu

Professor, Reykjavik University / Lead research scientist, Tallinn University of Technology

Verified email at ru.is - Homepage

logic semantics programming languages functional programming type theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Monads need not be endofunctors T Altenkirch, J Chapman, T Uustalu Logical Methods in Computer Science 11 (1), 2015	205	2015
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	146	2004
Comonadic notions of computation T Uustalu, V Vene Electronic Notes in Theoretical Computer Science 203 (5), 263-284, 2008	133	2008
The essence of dataflow programming T Uustalu, V Vene Central European Functional Programming School, 135-167, 2006	118	2006
The essence of dataflow programming T Uustalu, V Vene Asian Symposium on Programming Language and Systems, 2-18, 2005	118	2005
Primitive (co) recursion and course-of-value (co) iteration, categorically T Uustalu, V Vene Informatica 10 (1), 5-26, 1999	109	1999
Combining effects and coeffects via grading M Gaboardi, S Katsumata, D Orchard, F Breuvart, T Uustalu ACM SIGPLAN Notices 51 (9), 476-489, 2016	103	2016
Recursive coalgebras from comonads V Capretta, T Uustalu, V Vene Information and Computation 204 (4), 437-468, 2006	79	2006
Recursion schemes from comonads T Uustalu, V Vene, A Pardo Nordic Journal of Computing 8 (3), 366-390, 2001	75	2001
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	74	2005
Functional programming with apomorphisms (corecursion) V Vene, T Uustalu Proceedings of the Estonian Academy of Sciences: Physics, Mathematics 47 (3 …, 1998	63	1998
Trace-based coinductive operational semantics for While K Nakata, T Uustalu Theorem Proving in Higher Order Logics, 375-390, 2009	60*	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	58	2009
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	49	2015
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	46	2010
Corecursive algebras: A study of general structured corecursion V Capretta, T Uustalu, V Vene Brazilian Symposium on Formal Methods, 84-100, 2009	44	2009
Substitution in non-wellfounded syntax with variable binding R Matthes, T Uustalu Theoretical Computer Science 327 (1-2), 155-174, 2004	42	2004
Generalizing substitution T Uustalu RAIRO-Theoretical Informatics and Applications 37 (4), 315-336, 2003	41	2003
Mendler-style inductive types, categorically T Uustalu, V Vene Nordic Journal of Computing 6 (3), 343-361, 1999	41	1999
CPS translating inductive and coinductive types G Barthe, T Uustalu Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and …, 2002	39	2002

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors