Skip to main content
SpringerLink
Log in

Isomorphisms — A Link Between the Shallow and the Deep

  • Conference paper
  • First Online:
Theorem Proving in Higher Order Logics (TPHOLs 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1690))

Included in the following conference series:

Abstract

We present a theory of isomorphisms between typed sets in Isabelle/HOL. Those isomorphisms can serve to link a shallow embedding with a theory that defines certain concepts directly in HOL. Thus, it becomes possible to use the advantage of a shallow embedding that it allows for efficient proofs about concrete terms of the embedded formalism with the advantage of a deeper theory that establishes general abstract propositions about the key concepts of the embedded formalism as theorems in HOL.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. J. Bowen and M. Gordon. A shallow embedding of Z in HOL. Information and Software Technology, 37(5–6):269–276, 1995.

    Article  Google Scholar 

  2. L. Cardelli and P. Wegner. On understanding types, data abstraction, and polymorphism. Computing Surveys, 17(4):471–522, 1985.

    Article  Google Scholar 

  3. M. Gordon. Set theory, higher order logic or both? In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher Order Logics, LNCS 1125, pages 191–201. Springer-Verlag, 1996.

    Chapter  Google Scholar 

  4. M. J. C. Gordon and T. M. Melham, editors. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.

    Google Scholar 

  5. U. Hensel, M. Huisman, B. Jacobs, and H. Tews. Reasoning about classes in object-oriented languages: Logical models and tools. In C. Hankin, editor, Programming Languages and Systems-7th European Symposium on Programming, ESOP’98, LNCS 1381, pages 105–121. Springer-Verlag, 1998.

    Chapter  Google Scholar 

  6. C. A. R. Hoare. Proof of correctness of data representations. Acta Informatica, 1:271–281, 1972.

    Article  MATH  Google Scholar 

  7. Kolyang, T. Santen, and B. Wolff. A structure preserving encoding of Z in Isabelle/HOL. In J. von Wright, J. Grundy, and J. Harrison, editors, Theorem Proving in Higher-Order Logics, LNCS 1125, pages 283–298. Springer-Verlag, 1996.

    Chapter  Google Scholar 

  8. L. Lamport and L. C. Paulson. Should your specification language be typed? http://www.cl.cam.ac.uk/users/lcp/papers/lamport-paulson-types.ps.gz, 1997.

  9. B. Meyer. Reusable Software. Prentice Hall, 1994.

    Google Scholar 

  10. O. Müller. I/O automata and beyond: temporal logic and abstraction in Isabelle. In J. Grundy and M. Newey, editors, Theorem Proving in Higher Order Logics, LNCS 1479, pages 331–348. Springer-Verlag, 1998.

    Chapter  Google Scholar 

  11. O. Müller and K. Slind. Treating partiality in a logic of total functions. The Computer Journal, 40(10):640–651, 1997.

    Article  Google Scholar 

  12. W. Naraschewski and M. Wenzel. Object-oriented verification based on record subtyping in higher-order logic. In J. Grundy and M. Newey, editors, Theorem Proving in Higher Order Logics — 11th International Conference, TPHOLs’98, LNCS 1479, pages 349–366. Springer-Verlag, 1998.

    Chapter  Google Scholar 

  13. T. Nipkow. More Church/Rosser proofs (in Isabelle/HOL). In Automated Deduction — CADE 14, LNCS 1104, pages 733–747. Springer-Verlag, 1996.

    Google Scholar 

  14. S. Owre, N. Shankar, and J. M. Rushby. The PVS Specification Language. Computer Science Laboratory, 1993.

    Google Scholar 

  15. L. C. Paulson. Isabelle–A Generic Theorem Prover. LNCS 828. Springer-Verlag, 1994.

    MATH  Google Scholar 

  16. T. Santen. A theory of structured model-based specifications in Isabelle/HOL. In E. L. Gunter and A. Felty, editors, Proc. International Conference on Theorem Proving in Higher Order Logics, LNCS 1275, pages 243–258. Springer-Verlag, 1997.

    Chapter  Google Scholar 

  17. T. Santen. On the semantic relation of Z and HOL. In J. Bowen and A. Fett, editors, ZUM’98: The Z Formal Specification Notation, LNCS 1493, pages 96–115. Springer-Verlag, 1998.

    Google Scholar 

  18. T. Santen. A Mechanized Logical Model of Z and Object-Oriented Specification. PhDthesis, Fachbereich Informatik, Technische Universität Berlin, Germany, 1999. forthcoming.

    Google Scholar 

  19. J. M. Spivey. The Z Notation — A Reference Manual. Prentice Hall, 2nd edition, 1992.

    Google Scholar 

  20. H. Tej and B. Wolff. A corrected failure-divergence model for CSP in Isabelle/HOL. In J. Fitzgerald, C. B. Jones, and P. Lucas, editors, FME’97: Industrial Applications and Strengthened Foundations of Formal Methods, LNCS 1313, pages 318–337. Springer-Verlag, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Softwaretechnik, FR 5-6 Fachbereich Informatik, Technische Universität Berlin, Franklinstraβe 28/29, D-10587, Berlin, Germany

    Thomas Santen

Authors
  1. Thomas Santen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Sophia Antipolis, 2004 Route des Lucioles, F-06902, Sophia Antipolis Cedex, France

    Yves Bertot , Gilles Dowek  & Laurent Théry ,  & 

  2. University of Nice - Sophia Antipolis, Parc Valrose, F-06108, Nice Cedex 2, France

    André Hirschowitz

  3. University of Paris XI, 15, rue Georges Clemenceau, F-91405, Orsay Cedex, France

    Christine Paulin

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Santen, T. (1999). Isomorphisms — A Link Between the Shallow and the Deep. In: Bertot, Y., Dowek, G., Théry, L., Hirschowitz, A., Paulin, C. (eds) Theorem Proving in Higher Order Logics. TPHOLs 1999. Lecture Notes in Computer Science, vol 1690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48256-3_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-48256-3_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66463-5

  • Online ISBN: 978-3-540-48256-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation