Name
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s10817-020-09559-8 | JOURNAL OF AUTOMATED REASONING |
Keywords | DocType | Volume |
Interactive theorem proving,Program synthesis,ML,Higher-order logic | Journal | 64.0 |
Issue | ISSN | Citations |
SP7 | 0168-7433 | 0 |
PageRank | References | Authors |
0.34 | 0 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oskar Abrahamsson | 1 | 1 | 1.73 |
| Son Ho | 2 | 2 | 1.54 |
| Hrutvik Kanabar | 3 | 0 | 0.34 |
| Ramana Kumar | 4 | 141 | 13.56 |
| Magnus O. Myreen | 5 | 621 | 35.67 |
| Michael Norrish | 6 | 1091 | 61.77 |
| Yong Kiam Tan | 7 | 107 | 12.93 |