We show that any monad whose unit and extension operations are expressible as purely
functional terms can be embedded in a call-by-value language with “composable …

We present a strikingly simple partial evaluator, that is type-directed and reifies a compiled
program into the text of a residual, specialized program. Our partial evaluator is concise (a …

Multi-stage programming (MSP) is a paradigm for developing generic software that does not
pay a runtime penalty for this generality. This is achieved through concise, carefully …

We show that standard formulations of intersection type systems are unsound in the
presence of computational effects, and propose a solution similar to the value restriction for …

Bayesian inference, of posterior knowledge from prior knowledge and observed evidence, is
typically defined by Bayes's rule, which says the posterior multiplied by the probability of an …

Dynamic binding and delimited control are useful together in many settings, including Web
applications, database cursors, and mobile code. We examine this pair of language features …

First-class control operators provide programmers with an expressive and efficient means for
manipulating control through reification of the current control state as a first-class object …

Landin's SECD machine was the first abstract machine for the λ-calculus viewed as a
programming language. Both theoretically as a model of computation and practically as an …

Generic programming libraries such as Scrap Your Boilerplate eliminate the need to write
repetitive code, but typically introduce significant performance overheads. This leaves …

We present an abstract machine and a reduction semantics for the lambda-calculus
extended with control operators that give access to delimited continuations in the CPS …