HOL Light

E807604

HOL Light is an interactive theorem prover for higher-order logic, known for its small, clean implementation and use in formalizing significant mathematical results.

Try in SPARQL Jump to: Statements Referenced by

Statements (54)

Predicate Object
instanceOf higher-order logic theorem prover
interactive theorem prover
proof assistant
basedOn higher-order logic
designGoal clean implementation
small trusted kernel
soundness
developedBy John Harrison NERFINISHED
hasApplication formalization of mathematics
hardware verification
software verification
hasAuthor John Harrison NERFINISHED
hasComponent decision procedures
kernel
mathematical libraries
tactic library
hasFeature LCF-style architecture
automation for arithmetic
decision procedures for some theories
extensible libraries
interactive proof development
proof replay from scripts
rewriting and simplification
small inference kernel
support for algebraic structures
support for complex analysis
support for measure theory
support for multivariate calculus
support for real analysis
support for topology
tactic-based proof system
implementationLanguage OCaml NERFINISHED
influencedBy HOL theorem prover family NERFINISHED
LCF approach
license open source
notableFor clean and minimalist design
deep formalizations in analysis
formal proof of the Jordan curve theorem
formal proof of the Kepler conjecture (via Flyspeck)
formal proof of the prime number theorem
small trusted code base
platform Linux
Unix-like systems
macOS
relatedTo Coq NERFINISHED
HOL4 NERFINISHED
Isabelle/HOL NERFINISHED
Lean theorem prover NERFINISHED
requires OCaml compiler NERFINISHED
supportsLogic classical higher-order logic
usedFor formal verification of floating-point algorithms
formal verification of microprocessors
formalizing significant mathematical results
usedInProject Flyspeck project NERFINISHED

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

LCF theorem prover relatedTo HOL Light