The CakeML compiler is, to the best of our knowledge, the most realistic verified compiler for
a functional programming language to date. The architecture of the compiler, a sequence of …

We have developed and mechanically verified a new compiler backend for CakeML. Our
new compiler features a sequence of intermediate languages that allows it to incrementally …

WebAssembly (Wasm) is a new bytecode language supported by all major Web browsers,
designed primarily to be an efficient compilation target for low-level languages such as …

This paper presents a fully verified interactive theorem prover for higher-order logic, more
specifically: a fully verified clone of HOL Light. Our verification proof of this new system …

Type inference is essential for statically-typed languages such as OCaml and Haskell. It can
be decomposed into two (possibly interleaved) phases: a generator converts programs to …

The CakeML project has developed a proof-producing code generation mechanism for the
HOL4 theorem prover, a verified compiler for ML and, using these, a number of verified …

The technology of formal software verification has made spectacular advances, but how
much does it actually benefit the development of practical software? Considerable …

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 …

Validating OCaml soundness by translation into Coq Page 1 Introduction Translating types
Translating programs Conclusion Appendix Validating OCaml soundness by translation into …

Dependently typed languages allow us to state a program's expected properties and
automatically check that they are satisfied at compile time. Yet the implementations of these …