Brack: A Verified Compiler for Scheme via CakeML
Paper in proceeding, 2026
This paper describes Brack, which is a new verified compiler for Scheme. Brack compiles a substantial subset of Scheme, including first-class continuations, recursive bindings, first-class functions, mutable local variables, and lists, to CakeML, from where programs can be compiled to machine code. Compilation from Scheme to CakeML is based around a continuation-passing-style (CPS) transformation that naturally arises from Scheme's small-step semantics. We have formally established the correctness of Brack in the HOL4 theorem prover.
Scheme
compiler verification
HOL4
first-class continuations
CPS transform
Author
Pascal Y. Lasnier
University of Cambridge
Jeremy Yallop
University of Cambridge
Magnus Myreen
University of Gothenburg
Chalmers, Computer Science and Engineering (Chalmers), Formal methods
Cpp 2026 Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs Co Located with Popl 2026
157-170
9798400723414 (ISBN)
15th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2026
Rennes, France,
Rennes, France,
The next 700 verified compilers
Swedish Research Council (VR) (2021-05165), 2022-01-01 -- 2025-12-31.
Subject Categories (SSIF 2025)
Computer Sciences
Embedded Systems
Computer Systems
DOI
10.1145/3779031.3779098