# Compiling Purely Functional Structured Programs

## TL;DR

This paper introduces a language that combines functional and structured imperative programming within pure lambda calculus, implemented via a monadic DSL that produces lambda terms in continuation-passing style.

## Contribution

It presents a novel approach to embed structured imperative features into pure lambda calculus using a monadic DSL, bridging functional and imperative paradigms.

## Key findings

- Successfully embeds structured imperative programming in pure lambda calculus.
- Implements core language features in a monadic DSL.
- Generates lambda terms in continuation-passing style.

## 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.