Extending models of second order predicate logic to models of second order dependent type theory

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

Volumn 1258, Issue , 1997, Pages 167-181

  Geuvers, Herman ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; FORMAL LANGUAGES; FORMAL LOGIC; RECONFIGURABLE HARDWARE;

ASSOCIATED TYPES; DEPENDENT TYPE THEORY; EQUIVALENCE RELATIONS; FULL MODEL; PREDICATE LOGIC; SECOND ORDERS; SECOND-ORDER LOGIC; TYPE SYSTEMS;

COMPUTER CIRCUITS;

EID: 84888878901     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63172-0_38     Document Type: Conference Paper

References (16)

1. H.P. Barendregt, The lambda calculus: its syntax and semantics, revised edition. Studies in Logic and the Foundations of Mathematics, North Holland.
2. H.P. Barendregt, Typed lambda calculi. In Handbook of Logic in Computer Science, eds. Abramski et al., Oxford Univ. Press.
3. S. Berardi, Type dependence and constructive mathematics, Ph.D. thesis, Universita di Torino, Italy.
4. S. Berardi, Encoding of data types in Pure Construction Calculus: a semantic justification, in Logical Environments, eds. G. Huet and G. Plotkin, Cambridge University Press, pp 30-60.
5. Th. Coquand, Metamathematical investigations of a calculus of constructions. In Logic and Computer Science, ed. P.G. Odifreddi, APIC series, vol. 31, Academic Press, pp 91-122.
6. Th. Coquand and G. Huet, The calculus of constructions, Information and Computation, 76, pp 95-120.
7. D. van Dalen, Logic and Structure, third edition. Springer Verlag.
8. J.H. Geuvers, Logics and Type systems, PhD. Thesis, University of Nijmegen, Netherlands.
9. J.H. Geuvers, The Calculus of Constructions and Higher Order Logic, in The Curry-Howard isomorphism, ed. Ph. de Groote, Volume 8 of the "Cahiers du Centre de logique" (Universit~ catholique de Louvaln), Academia, Louvain-la-Neuve (Belgium), pp. 139-191.
10. M. Stefanova and J.H. Geuvers, A simple semantics for the Calculus of Constructions, to appear in the Proceedings of the ESPRIT-BRA 'Types' meeting, Turin, Italy, 1995.
11. J.-Y. Girard, Y. Lafont and P. Taylor, Proofs and types, Camb. Tracts in Theoretical Computer Science 7, Cambridge University Press.
12. R. Harper, F. Honsell and G. Plotkin, A framework for defining logics. Proceedings Second Symposium on Logic in Computer Science, (Ithaca, N.Y.), IEEE, Washington DC, pp 194-204.
13. W.A. Howard, The formulas-as-types notion of construction. In To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, eds. J.P. Seldin, J.R. Hindley, AcademicPress, New York, pp 479-490.
14. G. Longo and E. Moggi, Constructive Natural Deduction and its "Modest" Interpretation. Report CMU-CS-88-131.
15. R.P. Nederpelt, J.H. Geuvers and R.C. de Vrijer (editors), Selected Papers on Automath, Volume 133 in Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1994, pp 1024.
16. T. Streicher, Independence of the induction principle and the axiom of choice in the pure calculus of constructions, TCS 103(2), pp 395-409.