Candle: A Verified Implementation of HOL Light
Paper i proceeding, 2022

This paper presents a fully verified interactive theorem prover for higher-order logic, more specifically: a fully verified clone of HOL Light. Our verification proof of this new system results in an end-to-end correctness theorem that guarantees the soundness of the entire system down to the machine code that executes at runtime. Our theorem states that every exported fact produced by this machine-code program is valid in higher-order logic. Our implementation consists of a read-eval-print loop (REPL) that executes the CakeML compiler internally. Throughout this work, we have strived to make the REPL of the new system provide a user experience as close to HOL Light's as possible. To this end, we have, e.g., made the new system parse the same variant of OCaml syntax as HOL Light. All of the work described in this paper has been carried out in the HOL4 theorem prover.

Higher-order logic

Prover soundness

Interactive theorem proving

Författare

Oskar Abrahamsson

Chalmers, Data- och informationsteknik, Formella metoder

Magnus Myreen

Chalmers, Data- och informationsteknik, Formella metoder

Ramana Kumar

DeepMind

Thomas Sewell

University of Cambridge

Leibniz International Proceedings in Informatics, LIPIcs

18688969 (ISSN)

Vol. 237 3
9783959772525 (ISBN)

13th International Conference on Interactive Theorem Proving, ITP 2022
Haifa, Israel,

Ämneskategorier

Datorteknik

Inbäddad systemteknik

Datorsystem

DOI

10.4230/LIPIcs.ITP.2022.3

Mer information

Senast uppdaterat

2023-10-09