Programming is hard. Building a large program is like constructing a steam locomotive
through a hole the size of a postage stamp. An artefact that is the fruit of hundreds of person …

Patterns and Skeletons for Parallel and Distributed Computing is a unique survey of
research work in high-level parallel and distributed computing over the past ten years …

This thesis demonstrates how to reduce the runtime of large non-strict functional programs
using parallel evaluation. The parallelisation of several programs shows the importance of …

The ParaPhrase Refactoring Tool for Erlang PaRTE provides automatic, comprehensive and
reliable pattern candidate discovery to locate parallelisable components in Erlang programs …

Algorithmic skeletons are abstractions from common patterns of parallel activity which offer a
high degree of reusability for developers of parallel algorithms. Their close association with …

Algorithmic skeletons provide a promising basis for the automatic utilisation of parallelism at
sites of higher order function use through static program analysis. However, decisions about …

We propose program analyses to identify parallelizable code fragments, and program
transformations to change those fragments into applications of high-level parallel patterns …

Divide-and-conquer algorithms appear in the solution of many computationally intensive
problems, and are good candidates for parallelization. A divide-and-conquer computation …

The parallel functional language Eden extends Haskell with expressions to define and
instantiate process systems. These extensions allow also the easy definition of skeletons as …

Parallel computations in a program can be expressed conveniently, at a high level of
abstraction, using parallel patterns such as task farm, pipeline or divide-and-conquer. In …