PureCake: A Verified Compiler for a Lazy Functional Language-Reference-Cited by-同舟云学术

PureCake: A Verified Compiler for a Lazy Functional Language

Published:2023-06-06 Issue:PLDI Volume:7 Page:952-976
ISSN:2475-1421
Container-title:Proceedings of the ACM on Programming Languages
language:en
Short-container-title:Proc. ACM Program. Lang.

Author:

Kanabar Hrutvik¹^ORCID,Vivien Samuel²^ORCID,Abrahamsson Oskar³^ORCID,Myreen Magnus O.³^ORCID,Norrish Michael⁴^ORCID,Pohjola Johannes Åman⁵^ORCID,Zanetti Riccardo³^ORCID

Affiliation:

1. University of Kent, UK

2. ENS, France / Chalmers University of Technology, Sweden

3. Chalmers University of Technology, Sweden

4. Australian National University, Australia

5. University of New South Wales, Australia

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Link

https://dl.acm.org/doi/pdf/10.1145/3591259

Reference58 articles.

1. Samson Abramsky . 1990. The Lazy λ -Calculus . In Research Topics in Functional Programming . Addison Wesley . Samson Abramsky. 1990. The Lazy λ -Calculus. In Research Topics in Functional Programming. Addison Wesley.

2. Principled parsing for indentation-sensitive languages

3. Andrew W. Appel . 2014. Program Logics - for Certified Compilers . Cambridge University Press . isbn:978-1-10-704801-0 http://www.cambridge.org/de/academic/subjects/computer-science/programming-languages-and-applied-logic/program-logics-certified-compilers?format=HB Andrew W. Appel. 2014. Program Logics - for Certified Compilers. Cambridge University Press. isbn:978-1-10-704801-0 http://www.cambridge.org/de/academic/subjects/computer-science/programming-languages-and-applied-logic/program-logics-certified-compilers?format=HB

4. Formally proving a compiler transformation safe

5. Ready, set, verify! applying hs-to-coq to real-world Haskell code (experience report)