Abstract

In Martin-Löf's type theory, general recursion is not available. The only iterating constructs are primitive recursion over natural numbers and other inductive sets. The paper describes a way to allow a general recursion operator in type theory (extended with propositions). A proof rule for the new operator is presented. The addition of the new operator will not distroy the property that all well-typed programs terminate. An advantage of the new program construct is that it is possible to separate the termination proof of the program from the proof of other properties.

Citations

235	Constructive mathematics and computer programming - Martin-Lof - 1982
158	An introduction to inductive definitions - Aczel - 1977
123	Intuitionistic type theory. Bibliopolis - Martin-Löf - 1984
18	Constructing recursion operators in intuitionistic type theory - Paulson - 1986
13	A Programming System for Type Theory - Petersson - 1982
11	Types and specifications - Nordström, Petersson - 1983
10	Natural Deduction Proof as Higher-Order Resolution - Paulson - 1985
4	Well-founded Recursion in Type theory - Saaman, Malcolm - 1987
1	Propositions, types and specifications in Martin-L"of's type theory. bit - Nordstrom, Smith - 1984
1	The identification of propositions and types in Martin-L"of's type theory - Smith - 1983