Automatically Introducing Tail Recursion in CakeML

Abrahamsson, Oskar; Myreen, Magnus O.

doi:10.1007/978-3-319-89719-6_7

Cited by 4 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a platform for student projects, the compiler has worked well: masters and bachelorslevel students have thus far contributed a verified generational version of the garbage collector (Ericsson et al, 2017); a new verified optimisation that turns non-tail-recursive functions into tail-recursive functions (Abrahamsson & Myreen, 2017); and a tool for visualising the internals of the compiler (Hjort et al, 2017).…”

Section: Discussionmentioning

confidence: 99%

The verified CakeML compiler backend

Tan¹,

Myreen²,

Kumar³

et al. 2019

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Discussionmentioning

confidence: 99%

The verified CakeML compiler backend

Tan¹,

Myreen²,

Kumar³

et al. 2019

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

show abstract

“…1. Suppose that we want to transform it to a function on tree paths 1 as an alternative data type to labelled binary trees. For an A-labelled tree (of type T ree), Path is a datatype defined by the following grammar:…”

Section: Formal Definition Of the Synthesis Problemmentioning

confidence: 99%

“…Techniques based on program transformation have been applied to the synthesis of special classes of recursive programs before [13,15]. For example, the work in [1] focuses on tail recursion and a lot of attention has been given to producing divide-and-conquer recursions in the way of automated parallelization [2,8,23].…”

Section: Synthesis Through Program Transformationmentioning

confidence: 99%

Counterexample-Guided Partial Bounding for Recursive Function Synthesis

Nicolet

Farzan

2021

Computer Aided Verification

View full text Add to dashboard Cite

Quantifier bounding is a standard approach in inductive program synthesis in dealing with unbounded domains. In this paper, we propose one such bounding method for the synthesis of recursive functions over recursive input data types. The synthesis problem is specified by an input reference (recursive) function and a recursion skeleton. The goal is to synthesize a recursive function equivalent to the input function whose recursion strategy is specified by the recursion skeleton. In this context, we illustrate that it is possible to selectively bound a subset of the (recursively typed) parameters, each by a suitable bound. The choices are guided by counterexamples. The evaluation of our strategy on a broad set of benchmarks shows that it succeeds in efficiently synthesizing non-trivial recursive functions where standard across-the-board bounding would fail.

show abstract

Partial bounding for recursive function synthesis

Farzan

Nicolet

2023

Form Methods Syst Des

View full text Add to dashboard Cite

Automatically Introducing Tail Recursion in CakeML

Cited by 4 publications

References 9 publications

The verified CakeML compiler backend

The verified CakeML compiler backend

Counterexample-Guided Partial Bounding for Recursive Function Synthesis

Partial bounding for recursive function synthesis

Contact Info

Product

Resources

About