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 …

In functional programming it is common practice to build modular programs by composing
functions where the intermediate values are data structures such as lists or arrays. A …

The most widely used generic-programming system in the Haskell community, Scrap Your
Boilerplate (SYB), also happens to be one of the slowest. Generic traversals in SYB are …

We study conjunctive partial deduction, an advanced specialization technique aimed at
improving the performance of logic programs, in the context of relational programming …

Supercompilation is a program transformation technique that attempts to evaluate programs
as much as possible at compile time. Supercompilation has been used for theorem proving …

Суперкомпиляция–это метод преобразования программ, первоначально
разработанный ВФ Турчиным для языка программирования Рефал (функциональный …

A new method of multi-level supercompilation was suggested in [15]. It has been shown that
(1) multi-level supercompilation is superior to the classical (singlelevel) supercompilation …

The paper explains the principles of multi-result supercompilation. We introduce a formalism
for representing supercompilation algorithms as rewriting rules for graphs of configurations …

The most widely used generic-programming system in the Haskell community, Scrap Your
Boilerplate (SYB), also happens to be one of the slowest. Generic traversals in SYB are …

The time needed for program execution is rarely minimal. Often, a faster program exists that
produces the same output. Our superoptimizer aims to reduce the execution time of …