Steps towards Verified Implementations of HOL Light
This short paper describes our plans and progress towards construction of verified ML implementations of HOL Light: the first formally proved soundness result for an LCF-style prover. Building on Harrison’s formalisation of the HOL Light logic and our previous work on proof-producing synthesis of ML, we have produced verified implementations of each of HOL Light’s kernel functions. What remains is extending Harrison’s soundness proof and proving that ML’s module system provides the required abstraction for soundness of the kernel to relate to the entire theorem prover. The proofs described in this paper involve the HOL Light and HOL4 theorem provers and the OpenTheory toolchain.
Unable to display preview. Download preview PDF.
- 4.Myreen, M.O., Davis, J.: The reflective Milawa theorem prover is sound (2012), http://www.cl.cam.ac.uk/~mom22/jitawa/
- 5.Myreen, M.O., Owens, S.: Proof-producing synthesis of ML from higher-order logic. In: Thiemann, P., Findler, R.B. (eds.) International Conference on Functional Programming (ICFP). ACM (2012)Google Scholar
- 8.Wiedijk, F.: Stateless HOL. In: Hirschowitz, T. (ed.) Types for Proofs and Programs (TYPES). EPTCS (2009)Google Scholar