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

Rewriting is a general and expressive way of specifying concurrent systems, where
concurrent transitions are axiomatized by rewrite rules. Narrowing is a complete symbolic …

Partial evaluation is an automatic technique for program optimization which preserves
program semantics. The range of its potential applications is extremely large, as witnessed …

Partial evaluation is a method for program specialization based on fold/unfold
transformations [8, 25]. Partial evaluation of pure functional programs uses mainly static …

Natural semantics (big-step) and structural operational semantics (small-step) each have
advantages, so it can be useful to produce both semantic forms for a language. Previous …

We extend positive supercompilation to handle negative as well as positive information. This
is done by instrumenting the underlying unfold rules with a small rewrite system that handles …

Abstract Effect systems extend classical type systems with effect information. Just as types
describe the possible values of expressions, effects describe their possible evaluation …

Many functional logic languages are based on narrowing, a unification-based goal-solving
mechanism which subsumes the reduction mechanism of functional languages and the …

Previous deforestation and supercompilation algorithms may introduce accidental
termination when applied to call-by-value programs. This hides looping bugs from the …

This bibliography originated as a literature list collected for the Workshop on Partial
Evaluation and Mixed Computation. It contains references to all papers which are known to …