Varmo Vene

Tarmo Uustalu, Varmo Vene: The Recursion Scheme from the Cofree Recursive Comonad. Electr. Notes Theor. Comput. Sci. 229(5): 135-157 (2011)

Aivar Annamaa, Andrey Breslav, Jevgeni Kabanov, Varmo Vene: An Interactive Tool for Analyzing Embedded SQL Queries. APLAS 2010: 131-138

Vambola Leping, Marina Lepp, Margus Niitsoo, Eno Tõnisson, Varmo Vene, Anne Villems: Python prevails. CompSysTech 2009: 87

Helmut Seidl, Vesal Vojdani, Varmo Vene: A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis. FM 2009: 644-659

Venanzio Capretta, Tarmo Uustalu, Varmo Vene: Corecursive Algebras: A Study of General Structured Corecursion. SBMF 2009: 84-100

Tarmo Uustalu, Varmo Vene: Comonadic Notions of Computation. Electr. Notes Theor. Comput. Sci. 203(5): 263-284 (2008)

Venanzio Capretta, Tarmo Uustalu, Varmo Vene: Recursive coalgebras from comonads. Inf. Comput. 204(4): 437-468 (2006)

Peeter Laud, Tarmo Uustalu, Varmo Vene: Type systems equivalent to data-flow analyses for imperative languages. Theor. Comput. Sci. 364(3): 292-310 (2006)

Jevgeni Kabanov, Varmo Vene: Recursion Schemes for Dynamic Programming. MPC 2006: 235-252

Michael Johnson, Varmo Vene (Eds.): Algebraic Methodology and Software Technology, 11th International Conference, AMAST 2006, Kuressaare, Estonia, July 5-8, 2006, Proceedings. Lecture Notes in Computer Science 4019, Springer 2006, isbn 3-540-35633-9

Tarmo Uustalu, Varmo Vene: Signals and Comonads. J. UCS 11(7): 1310-1326 (2005)

Tarmo Uustalu, Varmo Vene: The Essence of Dataflow Programming. APLAS 2005: 2-18

Tarmo Uustalu, Varmo Vene: The Essence of Dataflow Programming. CEFP 2005: 135-167

Peeter Laud, Varmo Vene: A Type System for Computationally Secure Information Flow. FCT 2005: 365-377

Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene: Monadic augment and generalised short cut fusion. ICFP 2005: 294-305

Tarmo Uustalu, Varmo Vene: Comonadic functional attribute evaluation. Trends in Functional Programming 2005: 145-162

Varmo Vene, Tarmo Uustalu (Eds.): Advanced Functional Programming, 5th International School, AFP 2004, Tartu, Estonia, August 14-21, 2004, Revised Lectures. Lecture Notes in Computer Science 3622, Springer 2005, isbn 3-540-28540-7

Venanzio Capretta, Tarmo Uustalu, Varmo Vene: Recursive Coalgebras from Comonads. Electr. Notes Theor. Comput. Sci. 106: 43-61 (2004)

Neil Ghani, Tarmo Uustalu, Varmo Vene: Build, Augment and Destroy, Universally. APLAS 2004: 327-347

Neil Ghani, Tarmo Uustalu, Varmo Vene: Generalizing the AUGMENT combinator. Trends in Functional Programming 2004: 65-78

Tarmo Uustalu, Varmo Vene: Least and greatest fixed points in intuitionistic natural deduction. Theor. Comput. Sci. 272(1-2): 315-339 (2002)

Helmut Seidl, Varmo Vene, Markus Müller-Olm: Interprocedural Invariants. Universität Trier, Mathematik/Informatik, Forschungsbericht 02-10 (2002)

Tarmo Uustalu, Varmo Vene, Alberto Pardo: Recursion Schemes from Comonads. Nord. J. Comput. 8(3): 366-390 (2001)

Tarmo Uustalu, Varmo Vene: The Dual of Substitution is Redecoration. Scottish Functional Programming Workshop 2001: 99-110

Tarmo Uustalu, Varmo Vene: Primitive (Co)Recursion and Course-of-Value (Co)Iteration, Categorically. Informatica, Lith. Acad. Sci. 10(1): 5-26 (1999)

Tarmo Uustalu, Varmo Vene: Mendler-Style Inductive Types, Categorically. Nord. J. Comput. 6(3): 343- (1999)

Merik Meriste, Jaan Penjam, Varmo Vene: Models of Attributed Automata. Informatica, Lith. Acad. Sci. 9(1): 85-105 (1998)