Skip to main content

Importing HOL into Isabelle/HOL

  • Conference paper
Automated Reasoning (IJCAR 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4130))

Included in the following conference series:

Abstract

We developed an importer from both HOL 4 and HOL-light into Isabelle/HOL. The importer works by replaying proofs within Isabelle/HOL that have been recorded in HOL 4 or HOL-light and is therefore completely safe. Concepts in the source HOL system, that is types and constants, can be mapped to concepts in Isabelle/HOL; this facilitates a true integration of imported theorems and theorems that are already available in Isabelle/HOL. The importer is part of the standard Isabelle distribution.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. von Wright, J., Harrison, J., Grundy, J. (eds.): TPHOLs 1996. LNCS, vol. 1125. Springer, Heidelberg (1996)

    MATH  Google Scholar 

  2. Schürmann, C., Stehr, M.: An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, Springer, Heidelberg (2005)

    Google Scholar 

  3. Naumov, P., Stehr, M., Meseguer, J.: The HOL/NuPRL Proof Translator: A Practical Approach to Formal Interoperability. In: Boulton, R.J., Jackson, P.B. (eds.) TPHOLs 2001. LNCS, vol. 2152, Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Naumov, P.: Importing Isabelle Formal Mathematics into NuPRL. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L. (eds.) TPHOLs 1999. LNCS, vol. 1690, Springer, Heidelberg (1999)

    Google Scholar 

  5. Denney, E.: A Prototype Proof Translator from HOL to Coq. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol. 1869, Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Wiedijk, F.: Encoding the HOL Light logic in Coq. Unpublished notes

    Google Scholar 

  7. McLaughlin, S.: An interpretation of Isabelle/HOL in HOL Light (submitted)

    Google Scholar 

  8. Berghofer, S., Nipkow, T.: Proof terms for simply typed higher order logic. In: Aagaard, M.D., Harrison, J. (eds.) TPHOLs 2000. LNCS, vol. 1869, Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  9. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL: A Proof Assistant for Higher-Order Logic. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  10. The HOL System Description, http://hol.sourceforge.net

  11. Harrison, J.: The HOL Light manual, http://www.cl.cam.ac.uk/users/jrh/hol-light/manual-1.1.pdf

  12. Obua, S.: http://www4.in.tum.de/~obua/importer

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Obua, S., Skalberg, S. (2006). Importing HOL into Isabelle/HOL. In: Furbach, U., Shankar, N. (eds) Automated Reasoning. IJCAR 2006. Lecture Notes in Computer Science(), vol 4130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11814771_27

Download citation

  • DOI: https://doi.org/10.1007/11814771_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37187-8

  • Online ISBN: 978-3-540-37188-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics