A verified proof checker for higher-order logic
Artikel i vetenskaplig tidskrift, 2020

We present a computer program for checking proofs in higher-order logic (HOL) that is verified to accept only valid proofs. The proof checker is defined as functions in HOL and synthesized to CakeML code, and uses the Candle theorem prover kernel to check logical inferences. The checker reads proofs in the OpenTheory article format, which means proofs produced by various HOL proof assistants are supported. The proof checker is implemented and verified using the HOL4 theorem prover, and comes with a proof of soundness. (C) 2020 Elsevier Inc. All rights reserved.

Mechanized proof

Proof checker

Soundness

Higher-order logic

Författare

Oskar Abrahamsson

Chalmers, Data- och informationsteknik, Formella metoder

Journal of Logical and Algebraic Methods in Programming

2352-2208 (ISSN) 2352-2216 (eISSN)

Vol. 112 UNSP 100530

Ämneskategorier

Geometri

Datavetenskap (datalogi)

Matematisk analys

DOI

10.1016/j.jlamp.2020.100530

Mer information

Senast uppdaterat

2020-07-20