Proof-Producing Synthesis of CakeML from Monadic HOL Functions
2020 ◽
Vol 64
(7)
◽
pp. 1287-1306
◽
Keyword(s):
Abstract 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.
1988 ◽
Vol 46
◽
pp. 846-847
1972 ◽
Vol 22
(3)
◽
pp. 335-341
Keyword(s):
2010 ◽
Vol 130
(3)
◽
pp. 420-427
◽
Keyword(s):