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 …

Purely functional programs should run well on parallel hardware because of the absence of
side effects, but it has proved hard to realise this potential in practice. Plenty of papers …

Increasingly heterogeneous and hierarchical parallel architectures are now mainstream,
however, most of the traditional programming models are lowlevel and explicit, limiting …

We present a complete redesign of evaluation strategies, a key abstraction for specifying
pure, deterministic parallelism in Haskell. Our new formulation preserves the …

This paper presents a practical evaluation and comparison of three state-of-the-art parallel
functional languages. The evaluation is based on implementations of three typical symbolic …

Classical application domains of parallel computing are dominated by processing large
arrays of numerical data. Whereas most functional languages focus on lists and trees rather …

Parallel and distributed languages specify computations on multiple processors and have a
computation language to describe the algorithm, ie what to compute, and a coordination …

In this paper we present two mathematical formulations and a heuristic approach for the train
load planning problem of import containers at a seaport container terminal. The problem …

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 …

Enabling programmers to “think parallel” is critical if we are to be able to effectively exploit
future multicore/manycore architectures. This paper introduces paraforming: a new …