Name
Abstract | ||
|---|---|---|
Abstract We have designed an intermediate language (IL) for the CakeML compiler that supports the verified, efficient compilation of functions and calls. Verified compilation steps include batching of multiple curried arguments, detecting calls to statically known functions, and specialising calls to known functions with no free variables. Finally, we verify the translation to a lower-level IL that only supports closed, first-order functions. These compilation steps resemble those found in other compilers (especially OCaml). Our contribution here is the design of the semantics of the IL, and the demonstration that our verification techniques over this semantics work well in practice at this scale. The entire development was carried out in the HOL4 theorem prover. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3110262 | Proceedings of the ACM on Programming Languages |
DocType | Volume | Issue |
Journal | 1 | ICFP |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Scott Owens | 1 | 683 | 26.50 |
| Michael Norrish | 2 | 1091 | 61.77 |
| Ramana Kumar | 3 | 141 | 13.56 |
| Magnus O. Myreen | 4 | 621 | 35.67 |
| Yong Kiam Tan | 5 | 107 | 12.93 |