Recursive Models of General Inductive Types

We give an interpretation of Martin-Lof's type theory (with universes) extended with generalized inductive types. The model is an extension of the recursive model given by Beeson. By restricting our attention to PER model, we show that the strictness of positivity condition in the definition of generalized inductive types can be dropped. It therefore gives an interpretation of general inductive types in Martin-Lof's type theory.

[1]  Christian-Emil Ore,et al.  The Extended Calculus of Constructions (ECC) with Inductive Types , 1992, Inf. Comput..

[2]  Bengt Nordström,et al.  Programming in Martin-Lo¨f's type theory: an introduction , 1990 .

[3]  Peter Aczel,et al.  An Introduction to Inductive Definitions , 1977 .

[4]  Bengt Nordström,et al.  Programming in Martin-Löf's Type Theory , 1990 .

[5]  Anil Nerode,et al.  Logical Foundations of Computer Science — Tver '92 , 1992, Lecture Notes in Computer Science.

[6]  Robert L. Constable,et al.  Recursive Definitions in Type Theory , 1985, Logic of Programs.

[7]  Y. Moschovakis.  Elementary induction on abstract structures (Studies in logic and the foundations of mathematics) , 1974 .

[8]  Nax Paul Mendler,et al.  Predictive type universes and primitive recursion , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[9]  Frank Pfenning,et al.  Inductively Defined Types in the Calculus of Constructions , 1989, Mathematical Foundations of Programming Semantics.

[10]  Thierry Coquand,et al.  Inductively defined types , 1988, Conference on Computer Logic.

[11]  Michael Beeson,et al.  Recursive models for constructive set theories , 1982, Ann. Math. Log..

[12]  K. Jon Barwise.  Review: Yiannis Nicholas Moschovakis, Elementary induction on abstract structures , 1975 .

[13]  Zhaohui Luo,et al.  Inductive data types: well-ordering types revisited , 1993 .

[14]  P. Mendler.  Inductive Definition in Type Theory , 1988 .

[15]  Zhaohui Luo,et al.  A Higher-Order Calculus and Theory Abstraction , 1991, Inf. Comput..

[16]  N. P. Mendler,et al.  Inductive Types and Type Constraints in the Second-Order lambda Calculus , 1991, Ann. Pure Appl. Log..

[17]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

[18]  Zhaohui Luo,et al.  ECC, an extended calculus of constructions , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[19]  P. Dybjer.  Inductive sets and families in Martin-Lo¨f's type theory and their set-theoretic semantics , 1991 .

[20]  Zhaohui Luo.  An extended calculus of constructions , 1990 .

[21]  Peter Aczel,et al.  The Type Theoretic Interpretation of Constructive Set Theory: Inductive Definitions , 1986 .

[22]  N. P. Mendler,et al.  Recursive Types and Type Constraints in Second-Order Lambda Calculus , 1987, LICS.

[23]  G. C. Wraith.  A Note on Categorical Datatypes , 1989, Category Theory and Computer Science.

[24]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[25]  Zhaohui Luo,et al.  A Unifying Theory of Dependent Types: The Schematic Approach , 1992, LFCS.