Skip to main content
SpringerLink
Log in

Isabelle-91

  • Conference paper
  • First Online:
Automated Deduction—CADE-11 (CADE 1992)

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

Included in the following conference series:

Abstract

Isabelle is a generic theorem prover. Object-logics are formalized within higher-order logic, which is Isabelle's meta-logic. Proofs are performed by a generalization of resolution, using higher-order unification. The latest incarnation of Isabelle, Isabelle-91, features a type system based on order-sorted unification; this supports polymorphism and overloading in logic definitions.

Research supported by ESPRIT BRA 3245, Logical Frameworks.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27–57, 1975.

    Google Scholar 

  2. R. Milwer, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, 1990.

    Google Scholar 

  3. T. Nipkow. Order-sorted polymorphism in isabelle. In G. Huet, G. Plotkin, and C. Jones, editors, Proc. 2nd Workshop on Logical Frameworks, pages 307–321, 1991.

    Google Scholar 

  4. T. Nipkow and G. Snelting. Type classes and overloading resolution via order-sorted unification. In Proc. 5th ACM Conf. Functional Programming Languages and Computer Architecture, pages 1–14. LNCS 523, 1991.

    Google Scholar 

  5. L. C. Paulson. The foundation of a generic theorem prover. J. Automated Reasoning, 5:363–397, 1989.

    Google Scholar 

  6. L. C. Paulson. Isabelle: The next 700 theorem provers. In P. Odifreddi, editor, Logic and Computer Science, pages 361–385. Academic Press, 1990.

    Google Scholar 

  7. L. C. Paulson and T. Nipkow. Isabelle tutorial and user's manual. Technical Report 189, University of Cambridge, Computer Laboratory, 1990.

    Google Scholar 

  8. F. J. Pelletier. Seventy-five problems for testing automatic theorem provers. J. Automated Reasoning, 2:191–216, 1986. Errata, JAR 4 (1988), 236–236.

    Google Scholar 

Download references

Author information

Author notes

  1. Tobias Nipkow

    Present address: Institut für Informatik, TU München, Postfach 20 24 20, 8000, München 2, Germany

  2. Lawrence C. Paulson

    Present address: Computer Laboratory, University of Cambridge, Pembroke Street, CB2 3QG, Cambridge, England

Authors and Affiliations

    Authors
    1. Tobias Nipkow
      View author publications

      You can also search for this author in PubMed Google Scholar

    2. Lawrence C. Paulson
      View author publications

      You can also search for this author in PubMed Google Scholar

    Corresponding authors

    Correspondence to Tobias Nipkow or Lawrence C. Paulson .

    Editor information

    Deepak Kapur

    Rights and permissions

    Reprints and permissions

    Copyright information

    © 1992 Springer-Verlag Berlin Heidelberg

    About this paper

    Cite this paper

    Nipkow, T., Paulson, L.C. (1992). Isabelle-91. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_201

    Download citation

    • DOI: https://doi.org/10.1007/3-540-55602-8_201

    • Published:

    • Publisher Name: Springer, Berlin, Heidelberg

    • Print ISBN: 978-3-540-55602-2

    • Online ISBN: 978-3-540-47252-0

    • eBook Packages: Springer Book Archive

    Publish with us

    Policies and ethics

    Search

    Navigation