Please use this identifier to cite or link to this item:
Authors: Slind, Konrad
Keywords: Computer Science
Issue Date: 1-Jan-1991
Abstract: 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 chip production.
Appears in Collections:Technical Reports

Files in This Item:
File Description SizeFormat 
1991-419-3.pdf7.37 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.