Isabelle (proof assistant)

The Isabelle <a href="/facts/Automated_theorem_prover/vKGvuKFI">automated theorem prover</a> is a <a href="/facts/HOL_(proof_assistant)/xLdcpPeL">higher-order logic (HOL) theorem prover</a>, written in <a href="/facts/Standard_ML/4LaEq9tA">Standard ML</a> and <a href="/facts/Scala_(programming_language)/ebL8o6AK">Scala</a>. As a <a href="/facts/Logic_for_Computable_Functions/wJsqr2rJ">Logic for Computable Functions</a> (LCF) style theorem prover, it is based on a small logical core (kernel) to increase the trustworthiness of proofs without requiring, yet supporting, explicit proof objects.
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 <a href="/facts/Formal_methods/tw4FCWIb">formal methods</a>. It can be seen as an <a href="/facts/Integrated_development_environment/jbEINSQf">integrated development environment</a> (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 <a href="/facts/Lawrence_Paulson/kt3dnAkn">Lawrence Paulson</a> after <a href="/facts/G%C3%A9rard_Huet/127arH1z">Gérard Huet</a>'s daughter.
The Isabelle theorem prover is <a href="/facts/Free_software/IaoVtJXn">free software</a>, released under the revised <a href="/facts/BSD_license/XLtmLp5x">BSD license</a>.

Isabelle (proof assistant) open-in-new

Isabelle (proof assistant)