Proof-Producing Synthesis of CakeML with I/O and Local State from Monadic HOL Functions
Paper in proceedings, 2018

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 type inferencer 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.

Author

Son Ho

Mines ParisTech

Oskar Abrahamsson

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

R. Kumar

Commonwealth Scientific and Industrial Research Organisation (CSIRO)

Magnus Myreen

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

Yong Kiam Tan

Carnegie Mellon University (CMU)

M. Norrish

Commonwealth Scientific and Industrial Research Organisation (CSIRO)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 10900 646-662

9th International Joint Conference on Automated Reasoning, IJCAR 2018 Held as Part of the Federated Logic Conference, FloC 2018
Oxford, United Kingdom,

Subject Categories

Computer Science

Computer Systems

Mathematical Analysis

DOI

10.1007/978-3-319-94205-6_42

More information

Latest update

9/25/2018