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

In functional programming, intermediate data structures are often used to “glue” together
small programs. Deforestation is a program transformation to remove these intermediate …

Stream processing is mainstream (again): Widely-used stream libraries are now available
for virtually all modern OO and functional languages, from Java to C# to Scala to OCaml to …

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

This paper presents a termination technique for positive supercompilation, based on notions
from term algebra. The technique is not particularily biased towards positive …

This paper presents an attempt to characterize synchronous stream functions within the
framework of co-iteration and to use this characterization in building a compiler for (higher …

Partial deduction in the Lloyd–Shepherdson framework cannot achieve certain optimisations
which are possible by unfold/fold transformations. We introduce conjunctive partial …

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

Programs expressed in a high-level programming language need to be translated to a low-
level machine dialect for execution. This translation is usually accomplished by a compiler …

Multiple program specialization can stage a computation into several computation phases.
This paper presents an effective solution for multiple program specialization by generalizing …