Nested General Recursion and Partiality in Type Theory
- 24 August 2001
- book chapter
- Published by Springer Nature
- p. 121-125
- https://doi.org/10.1007/3-540-44755-5_10
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Partial objects in the calculus of constructionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A general formulation of simultaneous inductive-recursive definitions in type theoryThe Journal of Symbolic Logic, 2000
- Another Look at Nested RecursionPublished by Springer Nature ,2000
- Fix-Point Equations for Well-Founded Recursion in Type TheoryPublished by Springer Nature ,2000
- Termination of Nested and Mutually Recursive AlgorithmsJournal of Automated Reasoning, 1997
- The Alf proof editor and its proof enginePublished by Springer Nature ,1994
- The calculus of constructionsInformation and Computation, 1988
- Proving termination of normalization functions for conditional expressionsJournal of Automated Reasoning, 1986
- Recursive definitions in type theoryPublished by Springer Nature ,1985
- An Introduction to Inductive DefinitionsPublished by Elsevier ,1977