We describe a facility for improving optimization of Haskell programs using rewrite rules.
Library authors can use rules to express domain-specific optimizations that the compiler …

We present a novel programming language design that attempts to combine the clarity and
safety of high-level functional languages with the efficiency and parallelism of low-level …

We describe the design and current status of our effort to implement the programming model
of nested data parallelism into the Glasgow Haskell Compiler. We extended the original …

Purely functional, embedded array programs are a good match for SIMD hardware, such as
GPUs. However, the naive compilation of such programs quickly leads to both code …

Program transformation is the mechanical manipulation of a program in order to improve it
relative to some cost function and is understood broadly as the domain of computation …

It is well-known that the simply typed lambda-calculus is modeled by any cartesian closed
category (CCC). This correspondence suggests giving typed functional programs a variety of …

Inlining is a core transformation in optimizing compilers. It replaces a function call (call site)
with the body of the called function (callee). It helps reduce function call overhead and …

Severely resource-constrained devices present a confounding challenge to the functional
programmer: we are used to having powerful abstraction facilities at our fingertips, but how …

Key ideas in programming language design and implementation explained using a simple
and concise framework; a comprehensive introduction suitable for use as a textbook or a …

The applicability of term rewriting to program transformation is limited by the lack of control
over rule application and by the context-free nature of rewrite rules. The first problem is …