Proof-Producing Synthesis of CakeML with I/O and Local State from Monadic HOL Functions
Paper i proceeding, 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.

Författare

Son Ho

Mines ParisTech

Oskar Abrahamsson

Chalmers, Data- och informationsteknik, Formella metoder

R. Kumar

Commonwealth Scientific and Industrial Research Organisation (CSIRO)

Magnus Myreen

Chalmers, Data- och informationsteknik, Formella metoder

Yong Kiam Tan

Carnegie Mellon University (CMU)

M. Norrish

Commonwealth Scientific and Industrial Research Organisation (CSIRO)

Lecture Notes in Computer Science

0302-9743 (ISSN)

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,

Ämneskategorier

Datavetenskap (datalogi)

Datorsystem

Matematisk analys

DOI

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

Mer information

Senast uppdaterat

2018-09-25