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 …

Graphics processing units (GPUs) provide both memory bandwidth and arithmetic
performance far greater than that available on CPUs but, because of their Single-Instruction …

This practical tutorial introduces the features available in Haskell for writing parallel and
concurrent programs. We first describe how to write semi-explicit parallel programs by using …

The increasing availability of commodity multicore processors is making parallel computing
ever more widespread. In order to exploit its potential, programmers need languages that …

The Manticore project is an effort to design and implement a new functional language for
parallel programming. Unlike many earlier parallel languages, Manticore is a …

The increasing availability of commodity multicore processors is making parallel computing
available to the masses. Traditional parallel languages are largely intended for large-scale …

Data parallelism has proven to be an effective technique for high-level programming of a
certain class of parallel applications, but it is not well suited to irregular parallel …

Deterministic parallel programs yield the same results regardless of how parallel tasks are
interleaved or assigned to processors. This drastically simplifies reasoning about the …

Flattening nested parallelism is a vectorising code transform that converts irregular nested
parallelism into flat data parallelism. Although the result has good asymptotic performance …

The defunctionalization translation that eliminates higher-order functions from programs
forms a key part of many compilers. However, defunctionalization for dependently-typed …