On the strength of proof-irrelevant type theories

Logical Methods in Computer Science

Volumn 4, Issue 3, 2008, Pages

  Werner, Benjamin ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Coq; Lambda calculus; Logic; Proofs; Types

Indexed keywords

COQ; LAMBDA-CALCULUS; LOGIC; PROOFS; TYPES; AXIOM OF CHOICE; LAMBDA CALCULUS; LOGICAL FORMALISM; PROOF IRRELEVANCE; THEORETIC SEMANTICS;

COMPUTABILITY AND DECIDABILITY; DIFFERENTIATION (CALCULUS); FORMAL LANGUAGES; SEMANTICS; CALCULATIONS; COMPUTER CIRCUITS; FORMAL LOGIC;

THEOREM PROVING;

EID: 77955263403     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-4(3:13)2008     Document Type: Article

References (37)

1. P. Aczel. "On relating type theories and set theories", in Types for Proofs and Programs, edited by Altenkirch, Naraschewski and Reus, Proceedings of Types '98, LNCS 1657 (1999).
2. T. Altenkirch. "Proving strong normalization for CC by modifying realizability semantics". In H. Barendregt and T. Nipkow Eds, Types for Proofs and Programs, LNCS 806, Springer-Verlag, 1994.
3. T. Altenkirch. "Extensional Equality in Intensional Type Theory". LICS'99, IEEE, 1999.
4. H. Barendregt. Lambda Calculi with Types. Technical Report 91-19, Catholic University Nijmegen, 1991. In Handbook of Logic in Computer Science, Vol II, Elsevier, 1992.
5. B. Barras and B. Bernardo. "The Implicit Calculus of Constructions as a Programming Language with Dependent Types". In R. Amadio, editor, Proceedings of FOSSACS'08, volume 4962 of LNCS, pages 365-379. Springer-Verlag, 2008.
6. G. Barthe. "The relevance of proof-irrelevance". In K. G. Larsen, S. Skyum, and G. Winskel, editors, Proceedings of ICALP'98, volume 1443 of LNCS, pages 755-768. Springer-Verlag, 1998.
7. S. Berardi. "An Application of PER Models to Program Extraction". Mathematical Structures in Computer Science, vol. 3(3), pages 309-331, 1993.
8. F. Blanqui. "Definitions by rewriting in the Calculus of Constructions". Mathematical Structures in Computer Science, vol. 15(1), 2003.
9. J. Caldwell. "Moving Proofs-as-Programs into Practice", In Proceedings of the 12th IEEE International Conference on Automated Software Engineering, IEEE, 1997.
10. Chiyan Chen and Hongwei Xi, "Combining Programming with Theorem Proving". ICFP'05, IEEE, 2005.
11. The Coq Development Team. The Coq Proof-Assistant User's Manual, INRIA. On http://coq. inria. fr/.
12. T. Coquand and A. Spiwack. "A Proof of Strong Normalisation using Domain Theory". In Proceedings of LICS'06, IEEE, 2006.
13. P. Courtieu. "Normalized Types". Proceedings of CSL 2001, L. Fribourg Ed., LNCS 2142, Springer, 2001.
14. E. Gimenez. "A Tutorial on Recursive Types in Coq". INRIA Technical Report. 1999.
15. G. Gonthier. A computer-checked proof of the Four Colour Theorem. Manuscript, http://research. microsoft. com/~gonthier/4colproof. pdf, 2005.
16. B. Gregoire and X. Leroy. "A compiled implementation of strong reduction", proceedings of ICFP, IEEE, 2002.
17. B. Gregoire. Compilation des termes de preuves: un (nouveau) mariage entre Coq et Ocaml. These de doctorat, Universite Paris 7, 2003.
18. B. Gregoire, L. Thery and B. Werner. "A computational approach to Pocklington certificates in type theory". In proceedings of FLOPS 2006, M. Hagiya and P. Wadler (Eds), Volume 3945 of LNCS, Springer-Verlag, 2006.
19. M. Hofmann and T. Streicher. "A groupoid model refutes uniqueness of identity proofs". Proceedings of LICS'94, Paris. IEEE, 1994.
20. J. W. Klop. Combinatory Reduction Systems. Ph. D. Thesis, Utrecht University, 1980.
21. P. Letouzey. Programmation fonctionnelle certifiée: l'extraction de programmes dans l'assistant Coq. These de doctorat. Universite Paris-sud, 2004.
22. P. Letouzey. A New Extraction for Coq. In Geuvers and Wiedijk (Eds.), Proceedings of TYPES 2002, LNCS 2646, 2003.
23. Z. Luo. "ECC: An Extended Calculus of Constructions. " Proceedings of LICS'89, IEEE, 1989.
24. P. Martin-Lof. Intuitionistic Type Theory. Studies in Proof Theory, Bibliopolis, 1984.
25. C. McBride. "Elimination with a Motive". P. Callaghan, Z. Luo, J. McKinna and R. Pollack (Eds.), Proceedings of TYPES'00, LNCS 2277, Springer Verlag, 2002.
26. J. McKinna and R. Pollack. "Pure Type Systems formalized". In TLCA'93, M. Bezem and J. F. Groote Eds, LNCS 664, Springer-Verlag, Berlin, 1993.
27. P.-A. Mellies and B. Werner. "A Generic Normalization Proof for Pure Type System". In TYPES'96, E. Gimenez and C. Paulin-Mohring Eds, LNCS 1512, Springer-Verlag, Berlin, 1998.
28. A. Miquel. "The Implicit Calculus of Constructions". In proceedings of TLCA'01, LNCS 2044, Springer-Verlag, 2001.
29. A. Miquel and B. Werner. "The not so simple proof-irrelevant model of CC". In Geuvers and Wiedijk (Eds.), Proceedings of TYPES 2002, LNCS 2646, 2003.
30. A. Nogin and A. Kopilov. "Formalizing Type Operations Using the "Image" Type Constructor". To appear in WoLLIC 2006, ENTCS.
31. S. Owre and N. Shankar. "The Formal Semantics of PVS". SRI Technical Report CSL-97-2R. Revised March 1999.
32. C. Paulin-Mohring. Extraction de Programmes dans le Calcul des Constructions. These de doctorat, Universite Paris 7, 1989.
33. F. Pfenning. "Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory". In Pro-ceedings of LICS, IEEE, 2001.
34. J. Reynolds. "Polymorphism is not Set-Theoretic". In Semantics of Data Types, G. Kahn, D. MacQueen and G. Plotkin (Eds.), LNCS 173, Springer-Verlag, 1984.
35. M. Sozeau. "Subset Coercions in Coq". In TYPES'06, T. Altenkirch and C. McBride (Eds.), LNCS 4502, Springer-Verlag, 2007.
36. B. Werner. "Sets in Types, Types in Set". In, M. Abadi and T. Itoh (Eds), Theoretical Aspects of Computer Science, TACS'97, LNCS 1281, Springer-Verlag, 1997.
37. Hongwei Xi, Dependent Types in Practical Programming, Ph. D, CMU, 1998.