Lably
Skip to content

Isabelle (proof assistant)

Higher-order logic (HOL) automated theorem prover

  • 6 min read
  • 4 chapters

Related on Lably

Through Type theory, Counterexample and Function (computer programming)

Isabelle is available inside a flexible system framework allowing for logically safe extensions, which comprise both theories and implementations for code-generating, documenting, and specific support for a variety of formal methods. It can be seen as an integrated development environment (IDE) for formal methods. In recent years, a substantial number of theories and system extensions have been collected in the Isabelle Archive of Formal Proofs (Isabelle AFP).

Isabelle was named by Lawrence Paulson after Gérard Huet's daughter.

The Isabelle theorem prover is free software, released under the revised BSD license.

Features

Isabelle is generic: it provides a meta-logic (a weak type theory), which is used to encode object logics like first-order logic (FOL), higher-order logic (HOL) or Zermelo–Fraenkel set theory (ZFC). The most widely used object logic is Isabelle/HOL, although significant set theory developments were completed in Isabelle/ZF. Isabelle's main proof method is a higher-order version of resolution, based on higher-order unification.

Though interactive, Isabelle features efficient automatic reasoning tools, such as a term rewriting engine and a tableaux prover, various decision procedures, and, through the Sledgehammer proof-automation interface, external satisfiability modulo theories (SMT) solvers (including CVC4) and resolution-based automated theorem provers (ATPs), including E, SPASS, and Vampire (the Metis proof method reconstructs resolution proofs generated by these ATPs). It also features two model finders (counterexample generators): Nitpick and Nunchaku.

Isabelle features locales which are modules that structure large proofs. A locale fixes types, constants, and assumptions within a specified scope so that they do not have to be repeated for every lemma.

Isar ("intelligible semi-automated reasoning") is Isabelle's formal proof language. It is inspired by the Mizar system.

Sign in to keep reading

3 more chapters are free with a Lably account.

More in Computing and communication