Proof-irrelevant model of CC with predicative induction and judgmental equality

We present a set-theoretic, proof-irrelevant model for Calculus of Constructions (CC) with predicative induction and judgmental equality in Zermelo-Fraenkel set theory with an axiom for countably many inaccessible cardinals. We use Aczel's trace encoding which is universally defined for any function type, regardless of being impredicative. Direct and concrete interpretations of simultaneous induction and mutually recursive functions are also provided by extending Dybjer's interpretations on the basis of Aczel's rule sets. Our model can be regarded as a higher-order generalization of the truth-table methods. We provide a relatively simple consistency proof of type theory, which can be used as the basis for a theorem prover.

[1]  Iman Poernomo.  Yves Bertot and Pierre Casteran Interactive Theorem Proving and Program Development (Coq'Art: The Calculus of Inductive Constructions). Texts in Theoretical Computer Science. An EATCS Series. (2004). ISBN 3-540-20854-2. 469pp. Hardcover. , 2006 .

[2]  Robin Adams.  Pure type systems with judgemental equality , 2006, J. Funct. Program..

[3]  Yves Bertot,et al.  Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions , 2010 .

[4]  C. Paulin-Mohring.  Définitions Inductives en Théorie des Types , 1996 .

[5]  Y. Moschovakis.  Descriptive Set Theory , 1980 .

[6]  Hugo Herbelin,et al.  Equality Is Typable in Semi-full Pure Type Systems , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

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

[8]  Eduardo Giménez,et al.  Codifying Guarded Definitions with Recursive Schemes , 1994, TYPES.

[9]  Benjamin Werner,et al.  The Not So Simple Proof-Irrelevant Model of CC , 2002, TYPES.

[10]  Peter Aczel,et al.  On Relating Type Theories and Set Theories , 1998, TYPES.

[11]  Healfdene Goguen.  Soundness of the Logical Framework for Its Typed Operational Semantics , 1999, TLCA.

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

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

[14]  Healfdene Goguen.  A typed operational semantics for type theory , 1994 .

[15]  Zhaohui Luo,et al.  Computation and reasoning - a type theory for computer science , 1994, International series of monographs on computer science.

[16]  Benjamin Werner,et al.  Sets in Types, Types in Sets , 1997, TACS.

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

[18]  E. Van Gestel,et al.  Programming in Martin-Löf's Type Theory: an Introduction : Bengt Nordström, Kent Petersson and Jan M. Smith Intl. Series of Monographs on Computer Science, Vol. 7, Oxford Science Publications, Oxford, 1990, 231 pages , 1991 .

[19]  Pierre Letouzey,et al.  Programmation fonctionnelle certifiée : L'extraction de programmes dans l'assistant Coq. (Certified functional programming : Program extraction within Coq proof assistant) , 2004 .

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

[21]  Healfdene Goguen.  Typed Operational Semantics , 1995, TLCA.

[22]  F. R. Drake,et al.  Set theory : an introduction to large cardinals , 1974 .

[23]  John C. Reynolds,et al.  Polymorphism is not Set-Theoretic , 1984, Semantics of Data Types.

[24]  T. Coquand.  An algorithm for testing conversion in type theory , 1991 .

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

[26]  Peter Dybjer,et al.  A general formulation of simultaneous inductive-recursive definitions in type theory , 2000, Journal of Symbolic Logic.

[27]  Benjamin Werner.  On the Strength of Proof-irrelevant Type Theories , 2008, Log. Methods Comput. Sci..