Proof-Producing Synthesis of CakeML from Monadic HOL Functions
Journal article, 2020

We introduce an automatic method for producing stateful ML programs together with proofs of correctness from monadic functions in HOL. Our mechanism supports references, exceptions, and I/O operations, and can generate functions manipulating local state, which can then be encapsulated for use in a pure context. We apply this approach to several non-trivial examples, including the instruction encoder and register allocator of the otherwise pure CakeML compiler, which now benefits from better runtime performance. This development has been carried out in the HOL4 theorem prover.


Interactive theorem proving

Program synthesis

Higher-order logic


Oskar Abrahamsson

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

Son Ho

Université Paris PSL

Hrutvik Kanabar

University Of Kent

Ramana Kumar


Magnus Myreen

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

Michael Norrish

Australian National University

Yong Kiam Tan

Carnegie Mellon University (CMU)

Journal of Automated Reasoning

0168-7433 (ISSN) 1573-0670 (eISSN)

Vol. 64 7 1287-1306

Subject Categories

Computer Engineering

Computer Science

Mathematical Analysis



More information

Latest update