The verified CakeML compiler backend. (4th February 2019)

• Record Type: Journal Article
• Authors: KIAM TAN, YONG; MYREEN, MAGNUS O.; KUMAR, RAMANA; FOX, ANTHONY; OWENS, SCOTT; NORRISH, MICHAEL
• Is Part Of: Journal of functional programming. Volume 29(2019)
• Publication Date: 2019-02-04
• Subjects: Functional programming (Computer science) -- Periodicals
• DOI: 10.1017/S0956796818000229
• Languages: English
• ISSNs: 0956-7968

Abstract

Abstract: 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 intermediate languages through which high-level features are compiled away incrementally, enables verification of each compilation pass at an appropriate level of semantic detail. Parts of the compiler's implementation resemble mainstream (unverified) compilers for strict functional languages, and it supports several important features and optimisations. These include efficient curried multi-argument functions, configurable data representations, efficient exceptions, register allocation, and more. The compiler produces machine code for five architectures: x86-64, ARMv6, ARMv8, MIPS-64, and RISC-V. The generated machine code contains the verified runtime system which includes a verified generational copying garbage collector and a verified arbitrary precision arithmetic (bignum) library. In this paper, we present the overall design of the compiler backend, including its 12 intermediate languages. We explain how the semantics and proofs fit together and provide detail on how the compiler has been bootstrapped inside the logic of a theorem prover. The entire development has been carried out within the HOL4 theorem prover.