#### Filter Results:

- Full text PDF available (25)

#### Publication Year

1999

2018

- This year (1)
- Last 5 years (7)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Venanzio Capretta
- Logical Methods in Computer Science
- 2005

A fertile eld of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: theâ€¦ (More)

- Ana Bove, Venanzio Capretta
- Mathematical Structures in Computer Science
- 2005

Constructive type theory is a very expressive programming language. However, general recursive algorithms have no direct formalisation in type theory since they contain recursive calls that do notâ€¦ (More)

- Venanzio Capretta, Tarmo Uustalu, Varmo Vene
- Electr. Notes Theor. Comput. Sci.
- 2004

- Venanzio Capretta, Bernard Stepien, Amy P. Felty, Stan Matwin
- FMSE
- 2007

We describe the formalization of a correctness proof for a conflict detection algorithm for firewalls in the Coq Proof Assistant. First, we give formal definitions in Coq of a firewall access ruleâ€¦ (More)

- Venanzio Capretta, Tarmo Uustalu, Varmo Vene
- SBMF
- 2009

We study general structured corecursion, dualizing the work of Osius, Taylor, and others on general structured recursion. We call an algebra of a functor corecursive if it supports general structuredâ€¦ (More)

- Venanzio Capretta, Amy P. Felty
- TYPES
- 2006

Syntax in Coq Venanzio Capretta and Amy P. Felty School of Information Technology and Engineering and Department of Mathematics and Statistics University of Ottawa, Canada venanzio@cs.ru.nl,â€¦ (More)

- Ana Bove, Venanzio Capretta
- TPHOLs
- 2001

We extend Boveâ€™s technique for formalising simple general recursive algorithms in constructive type theory to nested recursive algorithms. The method consists in defining an inductive special-purposeâ€¦ (More)

- Gilles Barthe, Venanzio Capretta, Olivier Pons
- J. Funct. Program.
- 2003

Formalising mathematics in dependent type theory often requires to represent sets as setoids, i.e. types with an explicit equality relation. This paper surveys some possible definitions of setoidsâ€¦ (More)

The family T âˆ— does not depend on the function gâˆ—, because all calls to it have been replaced by f , and is not inductive, because all recursive occurrences of T in the constructors have beenâ€¦ (More)

- Venanzio Capretta
- TPHOLs
- 2001

We program the Fast Fourier Transform in type theory, using the tool Coq. We prove its correctness and the correctness of the Inverse Fourier Transform. A type of trees representing vectors withâ€¦ (More)