HOL4

E807605

HOL4 is an interactive theorem prover for higher-order logic, widely used in formal verification and based on the LCF approach to ensuring soundness.

Try in SPARQL Jump to: Statements Referenced by

Statements (49)

Predicate Object
instanceOf LCF-style theorem prover
interactive theorem prover
proof assistant
theorem prover
basedOn LCF approach
domain computer-aided verification
formal methods
formal verification
ensures soundness via small trusted kernel
hasFeature LCF-style abstract data type for theorems
co-inductive definitions
datatype package
decision procedures
export of proofs or theorems
extensible libraries
inductive definitions
interactive proof shell
proof recording and replay
proof tacticals
proof tactics
record package
rewriting engine
small trusted kernel
support for large-scale verification projects
theory management system
hasKernelLanguage Standard ML NERFINISHED
hasProgrammingLanguage Standard ML NERFINISHED
hasProperty LCF-style soundness guarantee
extensible via ML programming
higher-order logic as object logic
trusted kernel with untrusted automation
implementedIn Standard ML NERFINISHED
partOf HOL family of theorem provers NERFINISHED
relatedTo HOL Light NERFINISHED
HOL theorem prover family NERFINISHED
Isabelle/HOL NERFINISHED
supports formal verification
interactive proof development
machine-checked proofs
mechanized reasoning
proof automation
tactic-based proof construction
supportsLogic higher-order logic
usedFor hardware verification
mathematics formalization
protocol verification
software verification
usedIn formal methods research
industrial verification projects

Referenced by (1)

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