Extensionality in the Calculus of Constructions

This paper presents a method to translate a proof in an extensional version of the Calculus of Constructions into a proof in the Calculus of Inductive Constructions extended with a few axioms. We use a specific equality in order to translate the extensional conversion relation into an intensional system.

[1]  Jean-Pierre Jouannaud,et al.  The Calculus of algebraic Constructions , 1999, RTA.

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

[3]  Daria Walukiewicz-Chrzaszcz,et al.  Termination of rewriting in the Calculus of Constructions , 2003, Journal of Functional Programming.

[4]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[5]  Martin Hofmann,et al.  The groupoid model refutes uniqueness of identity proofs , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[6]  M. Hofmann.  Extensional concepts in intensional type theory , 1995 .

[7]  Conor McBride,et al.  Dependently typed functional programs and their proofs , 2000 .

[8]  Martin Hofmann,et al.  Extensional Constructs in Intensional Type Theory , 1997, CPHC/BCS Distinguished Dissertations.