Searching for "General Recursion in Type Theory." – sorted by Relevance.
-
Simple General Recursion in Type Theory
- Simple General Recursion in Type Theory Ana Bove Department of Computing Science Chalmers
- Cited by 6 (2 self) – Add To MetaCart
-
Modelling General Recursion in Type Theory
- Modelling General Recursion in Type Theory Ana Bove Venanzio Capretta y September 2002
- Cited by 25 (5 self) – Add To MetaCart
-
Nested General Recursion and Partiality in Type Theory
- Nested General Recursion and Partiality in Type Theory Ana Bove 1 and Venanzio Capretta 2 1
- Cited by 21 (9 self) – Add To MetaCart
-
in Type Theory
- methodology to formalise general recursive algorithms in type theory that separates the computational
- Add To MetaCart
-
Annual Site Reports 2001
- was working with V. Capretta on how write nested general recursion in type theory. The work resulted
- Add To MetaCart
-
Abstraction and Computation: Type Theory, Algebraic Structures, and Recursive Functions
- . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 157 6.2 Simple General Recursion in Type Theory . . . . . . . . . . . . . 159 6.3 Nested Recursion
- Add To MetaCart
-
Proceedings Of The First Workshop On Logical Frameworks
- : : : : : : : : : : 391 C. Phillips. Implementing General Recursion in Type Theory
- Add To MetaCart
-
Some domain theory and denotational semantics in Coq
- recursion in type theory. We exploit Coq’s support for coinductive datatypes [10], defining lifting in terms
- Cited by 1 (1 self) – Add To MetaCart

