A simple model construction for the calculus of constructions

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

Volumn 1158 LNCS, Issue , 1996, Pages 249-264

  Stefanova, M ^a   Geuvers, H ^b  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AXIOM OF CHOICE; CALCULUS OF CONSTRUCTION; CLASSICAL LOGIC; MODEL CONSTRUCTION; SIMPLE MODELING; STRONG NORMALIZATION;

THEOREM PROVING;

CALCULATIONS;

EID: 33645300186     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61780-9_74     Document Type: Conference Paper

References (17)

1. T. Altenkirch. Constructions, Inductive Types and Strong Normalization. PhD thesis, Laboratory for the Foundations of Computer Science, University of Edinburgh, 1993.
2. H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam, second, revised edition, 1984.
3. H. P. Barendregt. Typed lambda calculi. In Abramski, editor, Handbook of Logic in Computer Science. Oxford University Press, 1992.
4. S. Berardi. Encoding of data types in pure construction calculus: a semantic justification. In G. Plotkin and G. Huet, editors, Logical Enviroments, pages 30-60, Edinburgh, 1992.
5. S. Berardi. An application of per models to program extraction. Mathematical Structures in Computer Science, 3:309-331, 1993.
6. I. Bethke and J. W Klop. Collapsing partial combinatory algebras. Technical report, CWI, The Netherlands, 1995.
7. J. H. Geuvers. Semantics for dependent types (the calculus of constructions) by a 'double' model construction. Technical report, Department of Computer Science, University of Eindhoven, 1995.
8. J. H. Geuvers. A short and flexible proof of strong normalization for the calculus of constructions. In P. Dybjer, B. Nordstrom, and J. Smith, editors, Types for Proofs and Programs, Int. Workshop TYPES '94, Bdstad, Sweden, LNCS 996, pages 14-38, Edinburgh, 1995.
9. J.H. Geuvers and M.J. Nederhof. A modular proof of strong normalization for the calculus of constructions. Journal of Functional Programming, 1(2):155-189, 1991.
10. J.M. E. Hyland and C.-H. L. Ong. Modified readability and strong normalization proofs. In M. Bezem and J. F. Groote, editors, Typed Lambda Calculi and Applications, 1993.
11. J. M. E. Hyland and M. Pitts. The theory of constructions: Categorical semantics and topos-theoretic models. In Boulder, editor, AMS notes, 1987.
12. G. Longo and E. Moggi. Constructive natural deduction and its 'w-set' interpretation. Mathematical Structures in Computer Science, 1:215-254, 1991.
13. Z. Luo. A higher-order calculus and theory abstraction. IC, 90:107-137, 1991.
14. J. C. Reynolds. Polymorphism is not set-theoretic. In G. Kahn, D. B. McQueen, and G. Plotkin, editors, Lecture Notes in Computer Science 173, 1984.
15. M.T. Stefanova. Schematic proof of strong normalization for barendregt's-cube, 1995, Submitted, also available at http://www.cs.kun.nl/ ~milena.
16. T. Streicher. Semantics of Type Theory. Correctness, Completeness and Independence Results. Progress in Theoretical Computer Science. Birkhauser, Boston, 1991.
17. T. Streicher. Independence of the induction principle and the axiom of choice in the pure calculus of constructions. TCS, 103(2):395-409, 1992.