On the proof theory of Coquand's calculus of constructions

Annals of Pure and Applied Logic

Volumn 83, Issue 1, 1997, Pages 23-101

  Seldin, Jonathan P ^a  

^a Gina Cody School of Engineering and Computer Science   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031555569     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(96)00008-5     Document Type: Article

References (42)

1. [1] M. Beeson, Foundations of Constructive Mathematics (Springer, Berlin, 1985).
2. [2] S.E.G. Belaga, Are we really living in a world where the power-set axiom is a universal truth? Techn. Report 362/P-200, IRMA, Université Louis Pasteur, Strasbourg, France, 1988.
3. [3] C. Böhm and A. Berarducci, Automatic synthesis of typed Λ-programs on term algebras, Theoret. Comput. Sci. 39 (1985) 135-154.
4. [4] L. Cardelli, A polymorphic λ-calculus with type: type. Tech. Report, Systems Research Center of Digital Equipment Corporation, Palo Alto, California, May 1986.
5. [5] T. Coquand, Une Théorie des Constructions, Ph.D. Thesis, University of Paris VII (1985).
6. [6] T. Coquand, An analysis of Girard's paradox, in: Symposium on Logic in Computer Science, IEEE Computer Society (IEEE Computer Society Press, New York, 1986) 227-236.
7. [7] T. Coquand, Metamathematical investigations of a calculus of constructions. February 9, 1987, privately circulated, 1987.
8. [8] T. Coquand, Metamathematical investigations of a calculus of constructions, in: P. Odifreddi, ed., Logic and Computer Science (Academic Press, New York, 1990) 91-122.
9. [9] T. Coquand and G. Huet, Concepts mathématiques et informatiques formalisés dans le calcul des constructions, in: Ch. Berline, E. Bouscaren, M. Dickmann, J.-L. Krivine, D. Lascar, M. Parigot, E. Pelz, and G. Sabbagh, eds., Logic Colloquium '85: Proceedings of the Colloquium Held in Orsay, July 7-13, 1985, Studies in Logic and the Foundations of Mathematics, Vol. 122 (North-Holland, Amsterdam, 1986) 123-146.
10. [10] T. Coquand and G. Huet, Constructions: a higher order proof system for mechanizing mathematics, in: EUROCAL85, Lecture Notes in Computer Science, Vol. 203 (Springer, Berlin, 1986) 151-184.
11. [11] T. Coquand and G. Huet, The calculus of constructions, Inform. Comput. 76 (1988) 95-120.
12. [12] H.B. Curry and R. Feys, Combinatory Logic, Vol. 1 (North-Holland, Amsterdam, 1958) reprinted 1968 and 1974.
13. [13] H.B. Curry, J.R. Hindley and J.P. Seldin, Combinatory Logic, Vol. 2 (North-Holland, Amsterdam and London, 1972).
14. [14] D.T. van Daalen, The language theory of AUTOMATH, Ph.D. Thesis, Technische Hogeschool Eindhoven (1980).
15. [15] N.G. de Bruijn, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation with application to the Church-Rosser theorem, Indagationes Math. 34 (1972) 381-392.
16. [16] F.B. Fitch, Symbolic Logic (The Ronald Press Company, New York, 1952).
17. [17] J.-Y. Girard, Interprétation Fonctionnelle et Élimination des Coupures de L'Arithmétique d'Orde Supérieur, Ph.D. Thesis, University of Paris VII (1972).
18. [18] J.R. Hindley and J.P. Seldin, Introduction to Combinators and λ-calculus (Cambridge Univ. Press, Cambridge, 1986).
19. [19] W.A. Howard, The formulae-as-types notion of construction, in: J. Roger Hindley and Jonathan P. Seldin, eds., To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (Academic Press, New York, 1980) 479-490. A version of this paper was privately circulated in 1969.
20. [20] G. Huet, Formal structures for computation and deduction, Course Notes (Carnegie-Mellon University, 1st edn., May 1986).
21. [21] G. Huet, Induction principles formalized in the calculus of constructions, in: H. Ehrig, R. Kowalski, G. Levi and U. Montanari, eds., TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23-27, 1987. Vol. 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP '87), Lecture Notes in Computer Science, Vol. 249 (Springer, Berlin, 1987) 276-286.
22. [21] G. Huet, Induction principles formalized in the calculus of constructions, in: H. Ehrig, R. Kowalski, G. Levi and U. Montanari, eds., TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23-27, 1987. Vol. 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP '87), Lecture Notes in Computer Science, Vol. 249 (Springer, Berlin, 1987) 276-286.
23. [22] Z. Luo, ECC, an extended calculus of constructions, in: Proceedings of the Fourth Annual Symposium on Logic in Computer Science, June 1989, Asilomar, California (1989).
24. [23] Z. Luo, An Extended Calculus of Constructions, Ph.D. Thesis, University of Edinburgh, 1990.
25. [24] P. Martin-Löf, Hauptsatz for the theory of species, in: J.E. Fenstad, ed., Proceedings of the Second Scandinavian Logic Symposium (North-Holland, Amsterdam, 1971) 217-233.
26. [25] P. Martin-Löf, A theory of types, Revised October 1971, Privately circulated, February 1971.
27. [26] P. Martin-Löf, Hauptsatz for intuitionistic simple type theory, in: P. Suppes, L. Henkin, A. Joja and Gr.C̃. Moisil, eds., Logic, Methodology, and Philosophy of Science IV, International Congress for Logic, Methodology, and Philosophy of Science, Bucharest, 1971 (North-Holland, Amsterdam, 1973) 279-290.
28. [27] P. Martin-Löf, An intuitionistic theory of types: predicative part, in: H.E. Rose and J.C. Shepherdson, eds., Logic Colloquium '73 (North-Holland, Amsterdam, 1975) 73-118.
29. [28] P. Martin-Löf, Constructive mathematics and computer science, in: L.J. Cohen, J. Los, H. Pfeiffer and K.-P. Podewski, eds., Logic, Methodology and Philosophy of Science VI (North-Holland, Amsterdam, 1982) 153-175.
30. [29] P. Martin-Löf, Intuitionistic type theory, Bibliopolis, Naples, 1984. Notes by Giovanni Sambin of a series of lectures given in Padua, June 1980.
31. [30] J.C. Mitchell, A type-inference approach to reduction properties and semantics of polymorphic expressions (summary), in: Proceedings of the 1986 ACM Conference on LISP and Functional Programming (1986) 308-319.
32. [31] R.P. Nederpelt, Strong normalization in a typed lambda calculus with lambda structured types, Ph.D. Thesis, Technical University of Eindhoven (1973).
33. [32] G. Pottinger, Strong normalization for terms of the theory of constructions, Tech. Report TR 11-7, Odyssey Research Associates, December 1987.
34. [33] G. Pottinger, Definite descriptions and excluded middle in the theory of constructions, Circulated electronically to TYPES mailing list, November 1989.
35. [34] G. Pottinger, A tour of the multivariate lambda calculus, in: J. Michael Dunn and Anil Gupta, eds., Truth or Consequences: Essays in Honor of Nuel Belnap (Kluwer Academic Publishers, Dordrecht, 1990) 209-229.
36. [35] D. Prawitz, Natural Deduction (Almqvist & Wiksell, Stockholm, Göteborg, and Uppsala, 1965).
37. [36] J.P. Seldin, A sequent calculus for type assignment, J. Symbolic Logic 42 (1977) 11-28.
38. [37] J.P. Seldin, MATHESIS: the mathematical foundation for ULYSSES, Interim Report RADC-TR-87-223, Rome Air Development Center, Air force Systems Command, Griffiss Air Force Base, New York, November 1987. Actually published in 1988.
39. [38] J.P. Seldin, Coquand's calculus of constructions: a mathematical foundation for a proof development system, Formal Aspects Comput. 4 (1992) 425-441.
40. [39] J.P. Seldin, Excluded middle without definite descriptions in the theory of constructions, in: M. Okada and P.J. Scott, eds., MWPLT91 Spring, Proceedings of The First Montreal Workshop on Programming Language Theory, April 29-30, 1991 (1991) 74-83. Extended Abstract.
41. [40] J.P. Seldin, Interpreting Belaga's set theory in the calculus of constructions, Unpublished, July, 1991.
42. [41] S. Stenlund, Combinators, Lambda-Terms and Proof Theory (Reidel, Dordrecht, 1972).