Terminating general recursion
- 1 September 1988
- journal article
- other
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 28 (3) , 605-619
- https://doi.org/10.1007/bf01941137
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Constructive Mathematics and Computer ProgrammingPublished by Elsevier ,2014
- Constructing recursion operators in intuitionistic type theoryJournal of Symbolic Computation, 1986
- Propositions and specifications of programs in Martin-Löf's type theoryBIT Numerical Mathematics, 1984
- The identification of propositions and types in Martin-Löf's type theory: A programming exampleLecture Notes in Computer Science, 1983
- An Introduction to Inductive DefinitionsPublished by Elsevier ,1977