Safe proof checking in type theory with Y

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

Volumn 1683, Issue , 1999, Pages 439-452

  Geuvers, Herman ^a   Poll, Erik ^b   Zwanenburg, Jan ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; FORMAL LANGUAGES;

CONSERVATIVITY; EXTENDED SYSTEMS; INDUCTIVE-TYPE; META LANGUAGE; ORIGINAL SYSTEMS; PREDICATE LOGIC; PROOF CHECKING; PROOF SYSTEM;

COMPUTER CIRCUITS;

EID: 0347473949     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_31     Document Type: Conference Paper

References (9)

1. P. Audebaud. Partial Objects in the Calculus of Constructions, in Proceedings of the Sixth Annual Symp. on Logic in Computer Science, Amsterdam 1991, IEEE, pp. 86 – 95.
2. H.P. Barendregt, Lambda calculi with Types. In Handbook of Logic in Computer Science, eds. Abramski et al., Oxford Univ. Press, pp. 117-309.
3. S. Berardi, Type dependence and constructive mathematics, Ph.D. thesis, Universita di Torino, Italy.
4. Th. Coquand, Ch. Paulin-Mohring Inductively defined types, In P. Martin-L¨of and G. Mints editors. COLOG-88: International conference on computer logic, LNCS 417.
5. G. Dowek, A. Felty, H. Herbelin, G. Huet, Ch. Paulin-Mohring, B. Werner, The Coq proof assistant version 5.6, user’s guide. INRIA Rocquencourt - CNRS ENS Lyon.
6. H. Geuvers, Logics and Type Systems, Ph.D. Thesis, University of Nijmegen, 1993.
7. J.H. Geuvers and M.J. Nederhof, A modular proof of strong normalisation for the calculus of constructions. Journal of Functional Programming, vol 1 (2), pp 155-189.
8. J. Terlouw, Een nadere bewijstheoretische analyse van GSTT’s (incl. appendix), Manuscript, Faculty of Mathematics and Computer Science, University of Nijmegen, Netherlands, March, April 1989. (In Dutch)
9. J. Zwanenburg and H. Geuvers, Example of Proof Search by iteration in Coq, url: http://www.cs.kun.nl/˜janz/proofs/proofSearch/index.html