Nested General Recursion and Partiality in Type Theory (2000)

by Ana Bove , Venanzio Capretta
Venue:Theorem Proving in Higher Order Logics: 14th International Conference, TPHOLs 2001, volume 2152 of Lecture Notes in Computer Science
Citations:24 - 10 self

Documents Related by Co-Citation

65 A General Formulation of Simultaneous Inductive-Recursive Definitions in Type Theory – Peter Dybjer - 1998
38 Modelling General Recursion in Type Theory – Ana Bove, Venanzio Capretta - 2002
445 The formulae-as-types notion of construction – W A Howard - 1980
83 Infinite Objects in Type Theory – Thierry Coquand
70 Codifying guarded definitions with recursive schemes – Eduardo Giménez - 1995
163 Inductive Definitions in the System Coq Rules and Properties – Christine Paulin-Mohring - 1992
10 Fonctions récursives générales par itération en théorie des types – A Balaa, Y Bertot - 2002
14 Abstraction and Computation – Venanzio Capretta - 2002
22 Filters on coinductive streams, an application to eratosthenes’ sieve – Yves Bertot - 2005
10 Simple General Recursion in Type Theory – Ana Bove - 2000
46 A typed lambda calculus with categorical type constructors – Tatsuya Hagino - 1987
47 Proof-assistants using Dependent Type Systems – Henk Barendregt, Herman Geuvers - 2001
7 Generalized Coiteration Schemata – Daniela Cancila, Furio Honsell, Marina Lenisa - 2003
156 An intuitionistic theory of types: predicative part – P Martin-Löf - 1975
39 Termination of Nested and Mutually Recursive Algorithms – Jürgen Giesl - 1996
260 Programming in Martin-Löf’s Type Theory. An Introduction – B Nordström, K Petersson, J M Smith - 1990
342 Intuitionistic Type Theory – Per Martin-Löf - 1984
473 The Calculus of Constructions – T Coquand, G Huet - 1988
5 Mathematics of Recursive Program Construction – Henk Doornbos, Roland Backhouse - 2001