Varmo Vene - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

The Recursion Scheme from the Cofree Recursive ComonadTarmo Uustalu, Varmo Vene. ENTCS, 229(5):135-157, 2011. [doi]

2010

An Interactive Tool for Analyzing Embedded SQL QueriesAivar Annamaa, Andrey Breslav, Jevgeni Kabanov, Varmo Vene. aplas 2010: 131-138 [doi]

2009

2008

Comonadic Notions of ComputationTarmo Uustalu, Varmo Vene. ENTCS, 203(5):263-284, 2008. [doi]

2006

Recursive coalgebras from comonadsVenanzio Capretta, Tarmo Uustalu, Varmo Vene. iandc, 204(4):437-468, 2006. [doi]

Algebraic Methodology and Software Technology, 11th International Conference, AMAST 2006, Kuressaare, Estonia, July 5-8, 2006, ProceedingsMichael Johnson, Varmo Vene, editors, Volume 4019 of Lecture Notes in Computer Science, Springer, 2006.

Recursion Schemes for Dynamic ProgrammingJevgeni Kabanov, Varmo Vene. mpc 2006: 235-252 [doi]

Type systems equivalent to data-flow analyses for imperative languagesPeeter Laud, Tarmo Uustalu, Varmo Vene. TCS, 364(3):292-310, 2006. [doi]

2005

Monadic augment and generalised short cut fusionNeil Ghani, Patricia Johann, Tarmo Uustalu, Varmo Vene. ICFP 2005: 294-305 [doi]

A Type System for Computationally Secure Information FlowPeeter Laud, Varmo Vene. fct 2005: 365-377 [doi]

Signals and ComonadsTarmo Uustalu, Varmo Vene. jucs, 11(7):1310-1326, 2005. [doi]

Comonadic functional attribute evaluationTarmo Uustalu, Varmo Vene. sfp 2007: 145-162

The Essence of Dataflow ProgrammingTarmo Uustalu, Varmo Vene. cefp 2006: 135-167 [doi]

The Essence of Dataflow ProgrammingTarmo Uustalu, Varmo Vene. aplas 2005: 2-18 [doi]

Advanced Functional Programming, 5th International School, AFP 2004, Tartu, Estonia, August 14-21, 2004, Revised LecturesVarmo Vene, Tarmo Uustalu, editors, Volume 3622 of Lecture Notes in Computer Science, Springer, 2005.

2004

Recursive Coalgebras from ComonadsVenanzio Capretta, Tarmo Uustalu, Varmo Vene. ENTCS, 106:43-61, 2004. [doi]

Build, Augment and Destroy, UniversallyNeil Ghani, Tarmo Uustalu, Varmo Vene. aplas 2004: 327-347 [doi]

Generalizing the AUGMENT combinatorNeil Ghani, Tarmo Uustalu, Varmo Vene. sfp 2006: 65-78

2002

Least and greatest fixed points in intuitionistic natural deductionTarmo Uustalu, Varmo Vene. TCS, 272(1-2):315-339, 2002. [doi]

2001

The Dual of Substitution is RedecorationTarmo Uustalu, Varmo Vene. sfp 2002: 99-110

Recursion Schemes from ComonadsTarmo Uustalu, Varmo Vene, Alberto Pardo. njc, 8(3):366-390, 2001. [doi]

1999

Primitive (Co)Recursion and Course-of-Value (Co)Iteration, CategoricallyTarmo Uustalu, Varmo Vene. informaticaLT, 10(1):5-26, 1999. [doi]

Mendler-Style Inductive Types, CategoricallyTarmo Uustalu, Varmo Vene. njc, 6(3):343, 1999.

1998

Models of Attributed AutomataMerik Meriste, Jaan Penjam, Varmo Vene. informaticaLT, 9(1):85-105, 1998. [doi]