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 …