This paper shows how call-by-need supercompilation can be recast to be based explicitly on
an evaluator, contrasting with standard presentations which are specified as algorithms that …

When implementing a programming language, we often write a parser and a pretty-printer.
However, manually writing both programs is not only tedious but also error-prone; it may …

Deforestation is a compiler optimization that removes intermediate data structure allocations
from functional programs to improve their efficiency. This is an old idea, but previous …

One of the applications of supercompilation is proving properties of programs. We focus in
this paper on a specific task: proving term equivalence for a higher-order lazy functional …

Supercompilation is a program optimisation technique that is particularly effective at
eliminating unnecessary overheads. We have designed a new supercompiler, making many …

Haskell is a functional language, with features such as higher order functions and lazy
evaluation, which allow succinct programs. These high-level features present many …

Abstract The Java Supercompiler (JScp) is a specializer of Java programs based on the
Turchin's supercompilation method and extended to support imperative and object-oriented …

The paper deals with some aspects of metasystem transitions in the context of
supercompilation. We consider the manifestations of the law of branching growth of the …

We show that the power of supercompilation can be increased by constructing a hierarchy of
supercompilers, in which a lowerlevel supercompiler is used by a higher-level one for …

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