Abstract
This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and reconstruction of proof terms are described and have been implemented in the theorem prover Isabelle. Experimental results confirm the effectiveness of the compression scheme.
Supported by DFG Graduiertenkolleg Logic in Computer Science
This is a preview of subscription content, log in via an institution to check access.
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. P. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 118–309. Oxford University Press, 1992.
B. Barras, S. Boutin, C. Cornes, J. Courant, Y. Coscoy, D. Delahaye, D. de Rauglaudre, J.-C. Filliâtre, E. Giménez, H. Herbelin, G. Huet, H. Laulhère, C. Muñoz, C. Murthy, C. Parent-Vigouroux, P. Loiseleur, C. Paulin-Mohring, A. Saïbi, and B. Werner. The Coq proof assistant reference manual — version 6.3.1. Technical report, INRIA, 1999.
M. J. C. Gordon, J. M. J. Herbert, R. W. S. Hale, J. Harrison, W. Wong, and J. von Wright. Self-checking prover study — final report. Technical report, SRI, 1995. Available at http://www.csl.sri.com/reports/postscript/proofchecker.ps.gz.
D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497–536, 1991.
G. C. Necula. Proof-carrying code. In Conference Record of POPL’ 97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 106–119. ACM Press, New York, 1997.
G. C. Necula and P. Lee. Efficient representation and validation of proofs. In 13th IEEE Symp. Logic in Computer Science (LICS’98), pages 93–104. IEEE Computer Society Press, 1998.
T. Nipkow. Functional unification of higher-order patterns. In 8th IEEE Symp. Logic in Computer Science, pages 64–74. IEEE Computer Society Press, 1993.
L. C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5:363–397, 1989.
L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of LNCS. Springer, 1994.
F. J. Pelletier. Seventy-five problems for testing automatic theorem provers. Journal of Automated Reasoning, 2:191–216, 1986.
F. Pfenning. Logic programming in the LF Logical Framework. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 66–78. Cambridge University Press, 1991.
F. Pfenning. Unification and anti-unification in the calculus of constructions. In 6th IEEE Symposium on Logic in Computer Science, pages 74–85. IEEE Computer Society Press, 1991.
Z. Qian. Unification of higher-order patterns in linear time and space. Journal of Logic and Computation, 6:315–341, 1996.
W. Wong. Recording and checking HOL proofs. In E. Schubert, P. Windley, and J. Alves-Foss, editors, Higher Order Logic Theorem Proving and Its Applications. 8th International Workshop, volume 971 of LNCS, pages 353–68. Springer-Verlag, Berlin, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berghofer, S., Nipkow, T. (2000). Proof Terms for Simply Typed Higher Order Logic. In: Aagaard, M., Harrison, J. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2000. Lecture Notes in Computer Science, vol 1869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44659-1_3
Download citation
DOI: https://doi.org/10.1007/3-540-44659-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67863-2
Online ISBN: 978-3-540-44659-0
eBook Packages: Springer Book Archive