Plotkin's λ v-calculus for call-by-value programs is weaker than the λβη-calculus for the
same programs in continuation-passing style (CPS). To identify the call-by-value axioms that …

This paper investigates the transformation of v-terms into continuation-passing style (CPS).
We show that by appropriate-expansion of Fischer and Plotkin's two-pass equational speci …

Reynolds's defunctionalization technique is a whole-program transformation from higher-
order to first-order functional programs. We study practical applications of this transformation …

Plotkin's λ-value calculus is sound but incomplete for reasoning about βeegr;-
transformations on programs in continuation-passing style (CPS). To find a complete …

We unify previous work on the continuation-passing style (CPS) transformations in a generic
framework based on Moggi's computational meta-language. This framework is used to …

This thesis attempts to make precise the structure inherent in Continuation Passing Style
(CPS). We emphasize that CPS translates lambda-calculus into a very basic calculus that …

This paper describes the transformation of λ-terms from continuation-passing style (CPS) to
direct style. This transformation is the left inverse of Plotkin's left-to-right call-by-value CPS …

Binding-time improvements aim at making partial evaluation (aka program specialization)
yield a better result. They have been achieved so far mostly by hand-transforming the source …

Any analysis of higher-order languages must grapple with the tri-facetted nature of λ. In one
construct, the fundamental control, environment and data structures of a language meet and …

We present the design of a dynamic compilation system for C. Directed by a few declarative
user annotations specifying where and on what dynamic compilation is to take place, a …