Introduction to higher order categorical logic
Introduction to higher order categorical logic
An introduction to mathematical logic and type theory: to truth through proof
An introduction to mathematical logic and type theory: to truth through proof
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
A type-theoretical alternative to ISWIM, CUCH, OWHY
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Mechanical Theorem-Proving by Model Elimination
Journal of the ACM (JACM)
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
Verifying nonlinear real formulas via sums of squares
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Floating-Point verification using theorem proving
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
Automated cyclic entailment proofs in separation logic
CADE'11 Proceedings of the 23rd international conference on Automated deduction
A verified runtime for a verified theorem prover
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Verified efficient enumeration of plane graphs modulo isomorphism
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
A condensed semantics for qualitative spatial reasoning about oriented straight line segments
Artificial Intelligence
Communicating formal proofs: the case of flyspeck
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Steps towards verified implementations of HOL light
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Formal mathematics on display: a wiki for flyspeck
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
| Hi-index | 0.00 |
HOL Light is an interactive proof assistant for classical higher-order logic, intended as a clean and simplified version of Mike Gordon's original HOL system. Theorem provers in this family use a version of ML as both the implementation and interaction language; in HOL Light's case this is Objective CAML (OCaml). Thanks to its adherence to the so-called `LCF approach', the system can be extended with new inference rules without compromising soundness. While retaining this reliability and programmability from earlier HOL systems, HOL Light is distinguished by its clean and simple design and extremely small logical kernel. Despite this, it provides powerful proof tools and has been applied to some non-trivial tasks in the formalization of mathematics and industrial formal verification.