Compiling Purely Functional Structured Programs
classification
💻 cs.PL
keywords
functionallambdalanguagepurestructuredcalculuscompilingcontinuation-passing-style
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.