PureCake: A Verified Compiler for a Lazy Functional Language
Artikel i vetenskaplig tidskrift, 2023

We present PureCake, a mechanically-verified compiler for PureLang, a lazy, purely functional programming language with monadic effects. PureLang syntax is Haskell-like and indentation-sensitive, and its constraint-based Hindley-Milner type system guarantees safe execution. We derive sound equational reasoning principles over its operational semantics, dramatically simplifying some proofs. We prove end-To-end correctness for the compilation of PureLang down to machine code-The first such result for any lazy language-by targeting CakeML and composing with its verified compiler. Multiple optimisation passes are necessary to handle realistic lazy idioms effectively. We develop PureCake entirely within the HOL4 interactive theorem prover.

HOL4

interactive theorem proving

compiler verification

Haskell

Författare

Hrutvik Kanabar

University Of Kent

Samuel Vivien

ENS

Oskar Abrahamsson

Chalmers, Data- och informationsteknik, Formella metoder

Magnus Myreen

Chalmers, Data- och informationsteknik, Formella metoder

M. Norrish

Australian National University

Johannes Åman Pohjola

University of New South Wales (UNSW)

Riccardo Zanetti

Student vid Chalmers

Proceedings of the ACM on Programming Languages

24751421 (eISSN)

Vol. 7 145

Ämneskategorier

Inbäddad systemteknik

Datavetenskap (datalogi)

DOI

10.1145/3591259

Mer information

Senast uppdaterat

2024-01-03