Abstract
In this paper we give the first example of a significant piece of formal mathematics conducted in a hybrid of two different interactive systems. We constructively prove a theorem in Nuprl, from which a program can be extracted, but we use classical mathematics imported from HOL, and a connection to some of HOL's definitional packages, for parts of the proof that do not contribute to the program.
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
R. S. Boyer and J. S. Moore. A Computational Logic Handbook. Academic Press, New York, 1988.
J. Camilleri and T. Melham. Reasoning with inductively defined relations in the HOL theorem prover. Technical Report 265, University of Cambridge Computer Laboratory, August 1992.
R. L. Constable, et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, Englewood Cliffs, New Jersey, 1986.
C. Cornes, J. Courant, J.-C. Filliâtre, G. Huet, P. Manoury, C. Paulin-Mohring, C. Muñoz, C. Murthy, C. Parent, A. Saïbi, and B. Werner. The Coq Proof Assistant reference manual. Technical report, INRIA, 1995.
A. Felty and F. Stomp. A correctness proof of a cache coherence protocol. In Proceedings of the 11th Annual Conference on Computer Assurance, June 1996.
M. J. Gordon, A. J. Milner, and C. P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of Lecture Notes in Computer Science. Springer-Verlag, 1979.
M. J. C. Gordon and T. F. Melham. Introduction to HOL — A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
HOL90. The HOL90 distribution. (available from ftp://ftp.research.bell-labs.com/dist/hol90).
D. J. Howe. Importing mathematics from HOL into Nuprl. In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics, volume 1125 of Lecture Notes in Computer Science, pages 267–282, Berlin, 1996. Springer-Verlag.
D. J. Howe. Semantics foundations for embedding HOL in Nuprl. In M. Wirsing and M. Nivat, editors, Algebraic Methodology and Software Technology, volume 1101 of Lecture Notes in Computer Science, pages 85–101, Berlin, 1996. Springer-Verlag.
D. McAllester, J. Kučan, and D. Otth. A proof of strong normalization for F 2, F ω and beyond. Information and Computation, 121(2):193–200, September 1995.
T. Melham. A package for inductive relation definitions in HOL. In M. Archer, J. J. Joyce, K. N. Levitt, and P. J. Windley, editors, Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications, pages 350–357. IEEE Computer Society Press, 1992.
S. Owre, S. Rajan, J. Rushby, N. Shankar, and M. Srivas. PVS: Combining specification, proof checking, and model checking. In Proceedings of CAV'96, Lecture Notes in Computer Science. Springer Verlag, 1996.
L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
K. Schneider, R. Kuma, and T. Kropf. Integrating a first-order automatic prover in the HOL environment. In Proceedings of the 1991 International Tutorial and Workshop on the HOL Theorem Proving System and its Applications. IEEE Computer Society Press, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Felty, A.P., Howe, D.J. (1997). Hybrid interactive theorem proving using nuprl and HOL. In: McCune, W. (eds) Automated Deduction—CADE-14. CADE 1997. Lecture Notes in Computer Science, vol 1249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63104-6_34
Download citation
DOI: https://doi.org/10.1007/3-540-63104-6_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63104-0
Online ISBN: 978-3-540-69140-2
eBook Packages: Springer Book Archive