The HOL/NuPRL proof translator a practical approach to formal interoperability

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

Volumn 2152, Issue , 2001, Pages 329-345

  Naumov, Pavel ^a   Stehr, Mark Oliver ^b   Meseguer, José ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; SEMANTICS;

LOGICAL FOUNDATIONS; TECHNICAL ASPECTS; TWO-LINE;

THEOREM PROVING;

EID: 84949493208     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44755-5_23     Document Type: Conference Paper

References (23)

1. B. Barras et al. The Coq Proof Assistant Reference Manual: Version 6. 1. Technical Report RT-0203, INRIA, May 1997.
2. S. Berghofer and T. Nipkow. Proof terms for simply typed higher order logic. In M. Aagaard and J. Harrison, editors, 13th International Conference on Theorem Proving in Higher Order Logics, volume 1869 of Lecture Notes in Computer Science, pages 38–52, Portland, Oregon, August 2000. Springer.
3. R.L. Constable et al. Implementing Mathematics with Nuprl Proof Development System. Prentice Hall, 1986.
4. T. Coquand and G. Huet. The calculus of constructions. Information and Computation, 76(2/3):95–120, 1988.
5. N.G. de Bruijn. Lambda calculus notation withn ameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indag. Math., 34:381–392, 1972.
6. E. Denney. A Prototype Proof Translator from HOL to Coq. In M. Aagaard and J. Harrison, editors, The 13th International Conference on Theorem Proving in Higher Order Logics, volume 1869 of Lecture Notes in Computer Science, pages 108–125, Portland, Oregon, August 2000. Springer-Verlag.
7. A.P. Felty and D.J. Howe. Hybrid interactive theorem proving using Nuprl and HOL. In W. McCune, editor, Automated Deduction – CADE-14, volume 1249 of Lecture Notes in Artificial Intelligence, pages 351–365, Berlin, 1997. Springer- Verlag.
8. J. Goguen and R. Burstall. Institutions: Abstract model theory for specification and programming. Journal of the ACM, 39(1):95–146, 1992.
9. M.J.C. Gordon and T.F. Melham. Introduction to HOL – A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
10. D. J. Howe. A classical set-theoretic model of polymorphic extensional type theory. Manuscript.
11. 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.
12. D.J Howe. Semantics foundation for embedding HOL in Nuprl. In M. Wirsing and A. Nivat, editors, Algebraic Methodology and Software Technology, volume 1101 of Lecture Notes in Computer Science, pages 85–101, Berlin, 1996. Springer-Verlag.
13. P. Martin-Löf. Intuitionistic Type Theory. Bibliopolis, Napoli, 1984.
14. J. Meseguer. General logics. In H.-D. Ebbinghaus et al., editor, Logical Colloquium, 1987, pages 275–329. North-Holland, 1989.
15. R. Milner, M. Tofte, R.M. Harper, and D.B. MacQueen. The Definition of Standard ML (Revised). MIT Press, Cambridge, 1997.
16. G. Mints. A Short Introduction to Intuitionistic Logic. Kluwer Academic/Plenum Publishers, 2000.
17. P. Naumov. Importing Isabelle Formal Mathematics into NuPRL. In Supplemental proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics, Nice, France, September 1999.
18. P. Naumov. Formalization of Isabelle Meta Logic in NuPRL. In Supplemental proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics, pages 141–156, Portland, OR, August 2000.
19. L.C. Paulson. Isabelle – A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1994.
20. K. Petersson, J. Smith, and B. Nordstroem. Programming in Martin-L¨of’s Type Theory. An Introduction. International Series ofMonographs on Computer Science. Oxford: Clarendon Press, 1990.
21. M.-O. Stehr, P. Naumov, and J. Meseguer. A proof-theoretic approach to HOL-Nuprl connection witha pplications to proof translation (full version). http://cs.hbg.psu.edu/~naumov/Papers/holnuprl.ps, March 2000.
22. M.-O. Stehr, P. Naumov, and J. Meseguer. A proof-theoretic approach to HOLNuprl connection witha pplications to proof translation. In 15th International Workshop on Algebraic Development Techniques, Genova, Italy, April 2001. To appear. See [21] for the full version.
23. W. Wong. Validation of HOL proofs by proof checking. Formal Methods in System Design: An International Journal, 14(2):193–212, 1999.