Abstract
When proving a theorem, one makes intermediate claims, leaving parts temporarily unspecified. These ‘open’ parts may be proofs but also terms. In interactive theorem proving systems, one prominently deals with these ‘unfinished proofs’ and ‘open terms’. We study these ‘open phenomena’ from the point of view of logic. This amounts to finding a correctness criterion for ‘unfinished proofs’ (where some parts may be left open, but the logical steps that have been made are still correct). Furthermore we want to capture the notion of ‘proof state’. Proof states are the objects that interactive theorem provers operate on and we want to understand them in terms of logic.
In this paper we define ‘open higher order predicate logic’, an extension of higher order logic with unfinished (open) proofs and open terms. Then we define a type theoretic variant of this open higher order logic together with a formulas-as-types embedding from open higher order logic to this type theory. We show how this type theory nicely captures the notion of ‘proof state’, which is now a type-theoretic context.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Barendregt and H. Geuvers. Proof assistants using dependent type systems. In Handbook of Automated Reasoning. Elsevier Science Publishers B. V., 1999.
Henk Barendregt. Lambda calculi with types. In Abramsky et al., editor, Handbook of Logic in Computer Science, pages 117–309. Oxford University Press, 1992.
H. P. Barendregt. The λ-calculus: Its syntax and semantics. North-Holland, 1984.
Mirna Bognar. PhD thesis, VU Amsterdam, to appear, 2002.
J. H. Geuvers. Logics and Type systems. PhD thesis, University of Nijmegen.
G. I. Jojgov. Systems for open terms: An overview. Technical Report CSR 01-03, Technische Universiteit Eindhoven, 2001.
Zhaohui Luo. An Extended Calculus of Constructions. PhD thesis, University of Edinburgh, July 1990.
Zhaohui Luo. PAL+: A lambda-free logical framework. Lournal of Functional Programming, to appear.
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öteborg University, 1995.
Conor McBride. Dependently Typed Functional Programs and their Proofs. PhD thesis, University of Edinburgh, 1999.
Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497–536, 1991.
César A. Muñoz. A Calculus of Substitutions for Incomplete-Proof Representation in Type Theory. PhD thesis, INRIA, November 1997.
Lawrence C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5(3):363–397, 1989.
Frank Pfenning. Logical frameworks. In Handbook of Automated Reasoning, pages 1063–1147. 2001.
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.
M. Strecker. Construction and Deduction in Type Theories. PhD thesis, Universität Ulm, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geuvers, H., Jojgov, G.I. (2002). Open Proofs and Open Terms: A Basis for Interactive Logic. In: Bradfield, J. (eds) Computer Science Logic. CSL 2002. Lecture Notes in Computer Science, vol 2471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45793-3_36
Download citation
DOI: https://doi.org/10.1007/3-540-45793-3_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44240-0
Online ISBN: 978-3-540-45793-0
eBook Packages: Springer Book Archive