| 2011 | ||
|---|---|---|
| j9 | ||
| j8 | Venanzio Capretta: Coalgebras in functional programming and type theory. Theor. Comput. Sci. 412(38): 5006-5024 (2011) | |
| 2010 | ||
| j7 | Venanzio Capretta: Bisimulations Generated from Corecursive Equations. Electr. Notes Theor. Comput. Sci. 265: 245-258 (2010) | |
| 2009 | ||
| c12 | Venanzio Capretta, Tarmo Uustalu, Varmo Vene: Corecursive Algebras: A Study of General Structured Corecursion. SBMF 2009: 84-100 | |
| 2008 | ||
| c11 | ||
| 2007 | ||
| c10 | Venanzio Capretta, Bernard Stepien, Amy P. Felty, Stan Matwin: Formal correctness of conflict detection for firewalls. FMSE 2007: 22-30 | |
| c9 | ||
| 2006 | ||
| j6 | Venanzio Capretta, Tarmo Uustalu, Varmo Vene: Recursive coalgebras from comonads. Inf. Comput. 204(4): 437-468 (2006) | |
| c8 | Venanzio Capretta, Amy P. Felty: Combining de Bruijn Indices and Higher-Order Abstract Syntax in Coq. TYPES 2006: 63-77 | |
| 2005 | ||
| j5 | Venanzio Capretta: General recursion via coinductive types. Logical Methods in Computer Science 1(2) (2005) | |
| j4 | Ana Bove, Venanzio Capretta: Modelling general recursion in type theory. Mathematical Structures in Computer Science 15(4): 671-708 (2005) | |
| c7 | ||
| c6 | Stan Matwin, Amy P. Felty, István T. Hernádvölgyi, Venanzio Capretta: Privacy in Data Mining Using Formal Methods. TLCA 2005: 278-292 | |
| i1 | ||
| 2004 | ||
| j3 | Venanzio Capretta, Tarmo Uustalu, Varmo Vene: Recursive Coalgebras from Comonads. Electr. Notes Theor. Comput. Sci. 106: 43-61 (2004) | |
| 2003 | ||
| j2 | Gilles Barthe, Venanzio Capretta, Olivier Pons: Setoids in type theory. J. Funct. Program. 13(2): 261-293 (2003) | |
| 2002 | ||
| b1 | Venanzio Capretta: Abstraction and computation - type theory, algebraic structures, and recursive functions. Univ. Nijmegen 2002, isbn 978-90-9015738-2, pp. 1-259 | |
| c5 | Yves Bertot, Venanzio Capretta, Kuntal Das Barman: Type-Theoretic Functional Semantics. TPHOLs 2002: 83-98 | |
| 2001 | ||
| c4 | Ana Bove, Venanzio Capretta: Nested General Recursion and Partiality in Type Theory. TPHOLs 2001: 121-135 | |
| c3 | ||
| 2000 | ||
| c2 | ||
| 1999 | ||
| j1 | Venanzio Capretta, Silvio Valentini: A general method for proving the normalization theorem for first and second order typed lambda-calculi. Mathematical Structures in Computer Science 9(6): 719-739 (1999) | |
| c1 | ||
Colors in the list of coauthors
Last update Mon May 20 05:15:40 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page