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

Lists are often used as “glue” to connect separate parts of a program together. We propose
an automatic teehnique for improving the efficiency of such programs, by removing many of …

We introduce a positive supercompiler, a version of Turchin's supercompiler maintaining
only positive information during transformation, and using folding without generalization …

Languages that integrate functional and logic programming with a complete operational
semantics are based on narrowing, a unification-based goal-solving mechanism which …

In functional languages intermediate data structures are often used as glue to connect
separate parts of a program together. Deforestation is the process of automatically removing …

An abstract framework is developed to describe program transformation by specializing a
given program to a restricted set of inputs. Particular cases include partial evaluation [19] …

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 …

Given a program and some input data, partial deduction computes a specialized program
handling any remaining input more efficiently. However, controlling the process well is a …

The control of polyvariance is a key issue in partial deduction of logic programs. Certainly,
only finitely many specialised versions of any procedure should be generated, while, on the …

Partial evaluation is a performance optimization technique for computer programs. When a
program is run repeatedly with only small variations in its input, we can profit by taking the …