General Recursion in Type Theory
- 15 April 2003
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Type-Theoretic Functional SemanticsPublished by Springer Nature ,2002
- Nested General Recursion and Partiality in Type TheoryPublished by Springer Nature ,2001
- A general formulation of simultaneous inductive-recursive definitions in type theoryThe Journal of Symbolic Logic, 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
- Partial Functions in a Total SettingJournal of Automated Reasoning, 1997
- Terminating general recursionBIT Numerical Mathematics, 1988
- The calculus of constructionsInformation and Computation, 1988
- Proving termination of normalization functions for conditional expressionsJournal of Automated Reasoning, 1986
- An Introduction to Inductive DefinitionsPublished by Elsevier ,1977