Partial evaluation reconciles generality with efficiency by providing automatic specialization
and optimization of programs. Proceeding from a gentle introduction for reaching state-of-the …

We have built the first family of tagless interpretations for a higher-order typed object
language in a typed metalanguage (Haskell or ML) that require no dependent types …

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 …

Tutorial notes on partial evaluation Page 1 Tutorial Notes on Partial Evaluation Charles Consel
Olivier Danvy Pacific Software Research Center Department of Computing and Info. Sciences …

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 …

The Curry-Howard isomorphism identifies proofs with typed/spl lambda/-calculus terms, and
correspondingly identifies propositions with types. We show how this isomorphism can be …

We describe the design and implementation of a compiler that automatically translates
ordinary programs written in a subset of ML into code that generates native code at run time …

A major obstacle in partial evaluation (program specialization) is the need for binding time
improvements. By reorganizing a source program, the residual programs obtained by …

We introduce the notion of a perfect process tree as a model for the full propagation of
information in metacomputation. Starting with constant propagation we construct step-by …

This paper presents a partial evaluation system, for pure, higher-order, applicative
languages. This system named Schism, is based on a polyvariant binding-time analysis that …