HOL (proof assistant)

Known as: HOL theorem prover family, HOL, HOL4 
HOL (Higher Order Logic) denotes a family of interactive theorem proving systems usingsimilar (higher-order) logics and implementation strategies… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Given the high expressiveness of higher-order logic, their proof assistants are being widely advocated for formally verifying… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Formal system development needs expressive specification languag es, but also calls for highly automated tools. These two goals… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
When developing non-trivial formalizations in a theorem prover, a considerable amount of time is devoted to "debugging… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This article presents a Hoare-style calculus for a substantial subset of Java Card, which we call Java . In particular, the… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The original LCF system was a proof-checking program developed at Stanford University by Robin Milner in 1972. Descendents of LCF… (More)
Is this relevant?
1995
1995
Formal proofs generated by mechanised theorem proving systems may consist of a large number of inferences. As these theorem… (More)
Is this relevant?
1995
1995
We explore several ways to formalize the algebraic laws of CSP-like languages in HOL. The intent of the paper is to show how HOL… (More)
Is this relevant?
Highly Cited
1992
Highly Cited
1992
The semantics of hardware description languages can be represented in higher order logic. This provides a formal deenition that… (More)
Is this relevant?