HOL theorem prover family

HOL (Higher Order Logic) denotes a family of interactive theorem proving systems sharingsimilar logics and implementation strategies. Systems in this family follow the LCF approach as they are implemented as a library in some programming language.This library implements an abstract data type of proven theorems so that new objects of this type can only be created using the functions in the library which correspond to inference rules in higher-order logic. As long as these functions are correctly implemented, all theorems proven in the system must be valid. In this way, a large system can be built on top of a small trusted kernel.

Systems in the HOL family use the ML programming language or its successors. ML was originally developed along with LCF to serve the purpose of a meta-language for theorem proving systems; in fact, the name stands for "Meta-Language".

Members

There are three HOL systems (sharing essentially the same logic) that are still maintained and developed.The first, HOL4 stems from the HOL88 system, which was the culmination of the original HOL implementation effort, led by Mike Gordon.HOL88 included its own ML implementation, which was in turn implemented on top of Common Lisp.The implementations following HOL88 (HOL90, hol98 and HOL4) all used Standard ML as the implementation language. HOL4 and hol98 are tied to the Moscow ML implementation of Standard ML. Of these four systems, only HOL4 is being maintained and developed.All come with large libraries of theorem proving code.These implement extra automation on top of the very simple core code.

The second current implementation is HOL Light. Thisstarted as an experimental "minimalist" version of HOL. Although it has subsequentlygrown into another mainstream HOL variant, its logical foundations remain unusuallysimple. HOL Light used to be implemented in Caml Light, but now uses OCaml.

The third current implementation is ProofPower, originally a commercial system, designed to provide special support for working with the Z notation for formal specification. Like all the other implementations, ProofPower is now an Open source project.

HOL is a predecessor of Isabelle.

References

* cite web
last = Gordon
first = Michael J. C.
authorlink = Michael J. C. Gordon
year = 1996
title = From LCF to HOL: a short history
url = http://www.cl.cam.ac.uk/~mjcg/papers/HolHistory.html
accessdate = 2007-10-11

External links

* [http://hol.sourceforge.net/ HOL4 Project homepage]
* [http://www.lemma-one.com/ProofPower/specs/specs.html Documents specifying HOL's basic logic]
* [http://prdownloads.sourceforge.net/hol/kananaskis-3-description.pdf?download The HOL4 Description manual] , which includes a specification of the system's logic.
* [http://vl.fmnet.info/hol/ Virtual library formal methods information]