Isabelle: The Next 700 Theorem Provers
| dc.creator | Paulson, Lawrence C. | |
| dc.date | 2000-10-31 | |
| dc.date.accessioned | 2026-07-07T09:12:16Z | |
| dc.date.available | 2026-07-07T09:12:16Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/9301106 | |
| dc.identifier | http://arxiv.org/abs/cs/9301106 | |
| dc.identifier | published in P. Odifreddi (editor), Logic and Computer Science (Academic Press, 1990), 361-386 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151963 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.3.1; F.4.1 | |
| dc.title | Isabelle: The Next 700 Theorem Provers | |
| dc.type | text |