Fast, Verified Computation for Candle
Paper i 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

Författare

Oskar Abrahamsson

Chalmers, Data- och informationsteknik, Formella metoder

Magnus Myreen

Chalmers, Data- och informationsteknik, Formella metoder

Leibniz International Proceedings in Informatics, LIPIcs

18688969 (ISSN)

Vol. 268 4
9783959772846 (ISBN)

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

Ämneskategorier

Datorteknik

Datavetenskap (datalogi)

Datorsystem

DOI

10.4230/LIPIcs.ITP.2023.4

Mer information

Senast uppdaterat

2023-09-05