Apollo (University of Cambridge) · 1988 · 250 citations · 12 references
ComputingComputer ScienceMathematicsFormal MethodsLogicSet TheoryAutomated ReasoningFirst-order LogicInteractive Proof SystemsMathematical LogicTheorem ProvingType SystemsAutomated Theorem ProvingFormal Proof SystemsHigher-order LogicInteractive Theorem ProvingIsabelleProof SystemsType TheoryZermelo-fraenkel Set Theory
Isabelle is a generic theorem prover, designed for interactive reasoning in a variety of formal theories. At present it provides useful proof procedures for Constructive Type Theory, various first-order logics, Zermelo-Fraenkel set theory, and higher-order logic. This survey of Isabelle serves as an introduction to the literature. It explains why generic theorem proving is beneficial. It gives a thorough history of Isabelle, beginning with its origins in the LCF system. It presents an account of how logics are represented, illustrated using classical logic. The approach is compared with the Edinburgh Logical Framework. Several of the Isabelle object-logics are presented.
12
A formulation of the simple theory of types
Alonzo Church · Journal of Symbolic Logic · 1940 · 1.9K citations
A unification algorithm for typed λ-calculus
G. Huet · Theoretical Computer Science · 1975 · 509 citations
The foundation of a generic theorem prover
Lawrence C. Paulson · Journal of Automated Reasoning · 1989 · 384 citations