Partial evaluation provides a unifying paradigm for a broad spectrum of work in program
optimization compiling interpretation and the generation of automatic program generators …

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

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 …

Abstract Interpretation is a technique for the static analysis of dynamic properties of
programs. It is semantics based, that is, it computes approximative properties of the …

High level data structures are a cornerstone of modern programming and at the same time
stand in the way of compiler optimizations. In order to reason about user-or library-defined …

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

This article describes theoretical and practical aspects of an implemented self-applicable
partial evaluator for the untyped lambda-calculus with constants and a fixed point operator …

Generalized partial computation (GPC) is a program optimization principle based on partial
computation and theorem proving. Conventional partial computation methods (or partial …

Self-applicable partial evaluation has been implemented for half a decade now, but many
problems remain open. This paper addresses and solves the problems of automating call …

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 …