From LCF to Isabelle/HOL
arXiv:1907.02836 · doi:10.1007/s00165-019-00492-1
Abstract
Interactive theorem provers have developed dramatically over the past four decades, from primitive beginnings to today's powerful systems. Here, we focus on Isabelle/HOL and its distinctive strengths. They include automatic proof search, borrowing techniques from the world of first order theorem proving, but also the automatic search for counterexamples. They include a highly readable structured language of proofs and a unique interactive development environment for editing live proof documents. Everything rests on the foundation conceived by Robin Milner for Edinburgh LCF: a proof kernel, using abstract types to ensure soundness and eliminate the need to store proofs. Compared with the research prototypes of the 1970s, Isabelle is a practical and versatile tool. It is used by system designers, mathematicians and many others.
arXiv comment25 pages. Accepted to Formal Aspects of Computing
References in corpus (7)
- A formally verified compiler back-end
- Verifying Strong Eventual Consistency in Distributed Systems
- Integrating Testing and Interactive Theorem Proving
- The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle/ZF
- Computational Logic: Its Origins and Applications
- READ-EVAL-PRINT in Parallel and Asynchronous Proof-checking
- Deciding Univariate Polynomial Problems Using Untrusted Certificates in Isabelle/HOL