The wHOLe System
暂无分享,去创建一个
A theorem-proving system derived from Higher Order Logic (HOL) is described. The system is designed to support the verification of code written in its own implementation language (SML/NJ), and to allow code which is proven to preserve equality of hoLterms to be used to extend the system. The extension is shown to be theoretically conservative, and the implementation to be reliable. It is hoped that significant efficiency gains can be realized employing this technique (Computational Reflection).
[1] Don Syme,et al. Reasoning with the Formal Definition of Standard ML in HOL , 1993, HUG.
[2] Robin Milner,et al. Definition of standard ML , 1990 .
[3] M. Gordon,et al. Introduction to HOL: a theorem proving environment for higher order logic , 1993 .
[4] Carl A. Gunter,et al. The machine-assisted proof of programming language properties , 1996 .
[5] John Harrison,et al. HOL Light: A Tutorial Introduction , 1996, FMCAD.