Compiling Purely Functional Structured Programs

2017/03/15 by Scott, Phil, Obua, Steven, Fleuriot, Jacques
#FOS: Computer and information sciences #Programming Languages (cs.PL)

paper · doi:10.48550/arxiv.1703.05227

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.

Related

• Reduction Strategies in the Lambda Calculus and Their Implementation through Derivable Abstract Machines: Introduction
• Purely Functional Structured Programming
• A Tutorial Introduction to the Lambda Calculus
• The Functional Machine Calculus III: Control
• A Lambda-Calculus with letrec, case, constructors and non-determinism