Fast, Verified Computation for Candle
Paper in proceeding, 2023

This paper describes how we have added an efficient function for computation to the kernel of the Candle interactive theorem prover. Candle is a CakeML port of HOL Light which we have, in prior work, proved sound w.r.t. the inference rules of the higher-order logic. This paper extends the original implementation and soundness proof with a new kernel function for fast computation. Experiments show that the new computation function is able to speed up certain evaluation proofs by several orders of magnitude.

Prover soundness

Higher-order logic

Interactive theorem proving

Author

Oskar Abrahamsson

Chalmers, Computer Science and Engineering (Chalmers), Formal methods

Magnus Myreen

Chalmers, Computer Science and Engineering (Chalmers), Formal methods

Leibniz International Proceedings in Informatics, LIPIcs

18688969 (ISSN)

Vol. 268 4
9783959772846 (ISBN)

14th International Conference on Interactive Theorem Proving, ITP 2023
Bialystok, Poland,

Subject Categories

Computer Engineering

Computer Science

Computer Systems

DOI

10.4230/LIPIcs.ITP.2023.4

More information

Latest update

9/5/2023 1