The not so simple proof-irrelevant model of CC

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2646, Issue , 2003, Pages 240-258

  Miquel, Alexandre ^a   Werner, Benjamin ^b  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^b INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

CALCULUS OF CONSTRUCTION; PROOF IRRELEVANCE; SINGLE OBJECT; TECHNICAL DETAILS; THEORETICAL MODELING;

CALCULATIONS;

EID: 33845607186     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39185-1_14     Document Type: Article

References (23)

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. Extensional Equality in Intensional Type Theory. In Proceedings of the fourteenth Annual IEEE Symposium on Logic in Computer Science, IEEE, 1999.
3. 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.
4. F. Barbanera, S. Berardi. Proof-irrelevance out of Excluded Middle and Choice in the Calculus of Constructions. Journal of Functional Programming, vol.6(3), 519-525, 1996.
5. B. Barras and B. Werner. Coq in Coq. Manuscript.
6. G. Barthe. Domain-free pure type systems. Journal of Functional Programming, vol. 10(5), p. 412-452, 2000.
7. L. Chicli, L. Pottier and C. Simpson. Quotient Types in Coq. Presentation at the TYPES'01 Workshop, Nijmegen, 2001.
8. Th. Coquand. Une Théorie des Constructions. Thèse de Doctorat, Université Paris 7, janvier 1985.
9. Th. Coquand. Metamathematical Investigations of a Calculus of Constructions. In P. Oddifredi (editor), Logic and Computer Science. Academic Press, 1990. Rapport de recherche INRIA 1088.
10. Th. Coquand and G. Huet.The Calculus of Constructions. Information and Computation, 76(2/3), 1988.
11. H. Geuvers. Logics and Type Systems. PhD Thesis, Katholieke Universiteit Nijmegen, 1993.
12. J.-Y. Girard. Interprétation fonctionnelle et élimination des coupures de l'arithmétique d'ordre supérieur, Thèse d'État, Université Paris 7, 1972.
13. J.-Y. Girard. Translation and appendices Y. Lafont and P. Taylor. Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7. Cambridge Tracts in Theoretical Computer Science 7. Cambridge University Press, 1989.
14. J.-L. Krivine. Théorie des ensembles. Cassini, Paris, 1998.
15. P. Martin-Löf, Intuitionistic Type Theory. Studies in Proof Theory, Bibliopolis, 1984.
16. 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.
17. P.-A. Melliès and B. Werner. A Generic Normalization Proof for Pure Type Systems. In TYPES'96, E. Gimenez and C. Paulin-Mohring Eds, LNCS 1512, Springer-Verlag, Berlin, 1998.
18. A. Miquel. A Model for Impredicative Type Systems with Universes, Intersection Types and Subtyping. Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science (LICS'00), 2000.
19. A. Miquel. Le calcul des constructions implicite: syntaxe et sémantique. Thèse de doctorat, Université Paris 7, 2001.
20. J. Reynolds. Polymorphism is not Set-Theoretic, Semantics of Data Types. G. Kahn, D. B. MacQueen and G. Plotkin Eds. LNCS 173, pp. 145-156, Springer-Verlag, Berlin, 1984.
21. T. Streicher. Semantics of Type Theory. Progress in Theoretical Computer Science. Birkhaeuser Verlag, Basel 1991.
22. B. Werner. Sets in Types, Types in Sets. In, M. Abadi and T. Itoh (Eds), Theoretical Aspects of Computer Science, TACS'97, LNCS 1281, Springer-Verlag, 1997.
23. B. Werner. Une Théorie des Constructions Inductives. Thèse de Doctorat, Université Paris 7, 1994.