Compiling Purely Functional Structured Programs
Programming Languages
2017-03-17 v2
Abstract
We present a marriage of functional and structured imperative programming that embeds in pure lambda calculus. We describe how we implement the core of this language in a monadic DSL which is structurally equivalent to our intended source language and which, when evaluated, generates pure lambda terms in continuation-passing-style.
Cite
@article{arxiv.1703.05227,
title = {Compiling Purely Functional Structured Programs},
author = {Phil Scott and Steven Obua and Jacques Fleuriot},
journal= {arXiv preprint arXiv:1703.05227},
year = {2017}
}
Comments
5 pages