Open proofs and open terms: A basis for interactive logic

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

Volumn 2471, Issue , 2002, Pages 537-552

  Geuvers, Herman ^a   Jojgov, Gueorgui I ^b  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Formulas as types; Interactive theorem proving; Metavariables; Open terms; Type theory

Indexed keywords

FORMAL LANGUAGES; FORMAL LOGIC; THEOREM PROVING;

FORMULAS-AS-TYPES; INTERACTIVE THEOREM PROVING; METAVARIABLES; OPEN TERMS; TYPE THEORY;

COMPUTER CIRCUITS;

EID: 84947778785     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45793-3_36     Document Type: Conference Paper

References (16)

1. [1] H. Barendregt and H. Geuvers. Proof assistants using dependent type systems. In Handbook of Automated Reasoning. Elsevier Science Publishers B.V., 1999.
2. [2] Henk Barendregt. Lambda calculi with types. In Abramsky et al., editor, Handbook of Logic in Computer Science, pages 117–309. Oxford University Press, 1992.
3. [3] H.P. Barendregt. The λ-calculus: Its syntax and semantics. North-Holland, 1984.
4. [4] Mirna Bognar. PhD thesis, VU Amsterdam, to appear, 2002.
5. [5] J.H. Geuvers. Logics and Type systems. PhD thesis, University of Nijmegen.
6. [6] G. I. Jojgov. Systems for open terms: An overview. Technical Report CSR 01-03, Technische Universiteit Eindhoven, 2001.
7. [7] Zhaohui Luo. An Extended Calculus of Constructions. PhD thesis, University of Edinburgh, July 1990.
8. [8] Zhaohui Luo. PAL+: A lambda-free logical framework. Lournal of Functional Programming, to appear.
9. [9] Lena Magnusson. The Implementation of ALF - a Proof Editor based on Martin- Löf Monomorphic Type Theory with Explicit Substitutions. PhD thesis, Chalmers University of Technology/G¨oteborg University, 1995.
10. [10] Conor McBride. Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh, 1999.
11. [11] Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497–536, 1991.
12. [12] César A. Muoz. A Calculus of Substitutions for Incomplete-Proof Representation in Type Theory. PhD thesis, INRIA, November 1997.
13. [13] Lawrence C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5(3):363–397, 1989.
14. [14] Frank Pfenning. Logical frameworks. In Handbook of Automated Reasoning, pages 1063–1147. 2001.
15. [15] P. Severi and E. Poll. Pure Type Systems with definitions. In Proc. of LFCS’94, St. Petersburg, Russia, number 813 in LNCS, Berlin, 1994. Springer Verlag.
16. [16] M. Strecker. Construction and Deduction in Type Theories. PhD thesis, Universität Ulm, 1998.