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.
Unable to display preview. Download preview PDF.
- G. Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27–57, 1975.Google Scholar
- R. Milwer, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, 1990.Google Scholar
- 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
- 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
- L. C. Paulson. The foundation of a generic theorem prover. J. Automated Reasoning, 5:363–397, 1989.Google Scholar
- 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
- L. C. Paulson and T. Nipkow. Isabelle tutorial and user's manual. Technical Report 189, University of Cambridge, Computer Laboratory, 1990.Google Scholar
- 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