Hybrid interactive theorem proving using nuprl and HOL

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

Volumn 1249, Issue , 1997, Pages 351-365

  Felty, Amy P ^a   Howe, Douglas J ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION;

FORMAL MATHEMATICS; INTERACTIVE SYSTEM; INTERACTIVE THEOREM PROVING;

THEOREM PROVING;

EID: 84957083499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63104-6_34     Document Type: Conference Paper

References (15)

1. R. S. Boyer and J. S. Moore. A Computational Logic Handbook. Academic Press, New York, 1988.
2. 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.
3. R. L. Constable, et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, Englewood Cliffs, New Jersey, 1986.
4. C. Comes, J. Courant, J.-C. Filliâtre, G. Huet, P. Manoury, C. Paulin-Mohring, C. Muñoz, C. Murthy, C. Parent, A. SaIbi, and B. Werner. The Coq Proof Assistant reference manual. Technical report, INRIA, 1995.
5. 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.
6. 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.
7. M. J. C. Gordon and T. F. Melham. Introduction to HOL-A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
8. HOL90. The HOL9U distribution. (available from ftp://ftp.research.bell- labs.com/dist/hol90).
9. 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.
10. 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.
11. ω and beyond. Information and Computation, 121(2):193-200, September 1995.
12. 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.
13. 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.
14. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
15. 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.