In this thesis, we present an LCF-style implementation of
Higher Order Logic. This is a re-implementation of Mike Gordon's
hol88 system. We present the implementation in detail, and to a
much lower level than previously. We formally specify the
primitive algorithms of the implementation and make a start on
proving the correctness of the implementation by verifying
one of these algorithms.
To augment the power of the theorem prover, we also integrate methods
of proof from the field of Term Rewriting Systems into our
implementation. This significantly enhances the equality reasoning
capability of the system.
Finally, we establish a formal link between circuit verification and
We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at firstname.lastname@example.org