Isabelle (proof assistant)

The Isabelle automated theorem prover is a higher-order logic (HOL) theorem prover, written in Standard ML and Scala. As an 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
Original author(s)Lawrence Paulson
Developer(s)University of Cambridge and Technical University of Munich et al.
Initial release1986
Stable release
Isabelle2022 / October 2022 (2022-10)
Written inStandard ML and Scala
Operating systemLinux, Windows, macOS
TypeMathematics
LicenseBSD license
Websiteisabelle.in.tum.de

Isabelle is available inside a flexible system framework allowing for logically safe extensions, which comprise both theories as well as implementations for code-generation, documentation, and specific support for a variety of formal methods. It can be seen as an 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.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.