The type systems of most typed functional programming languages are based on the
Hindley-Milner type system. A practical problem with these type systems is that it is often …

This paper discusses an extension of Haskell by support for nested data-parallel
programming in the style of the special-purpose language Nesl. The extension consists of a …

Innovative traffic engineering functions and services require disrupting routing and
forwarding mechanisms to be performed with low overhead over complex network …

Recent work showed that compiling functional programs to use dense, serialized memory
representations for recursive algebraic datatypes can yield significant constant-factor …

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

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 …

This paper generalises the flattening transformation---a technique for the efficient
implementation of nested data parallelism---and reconciles it with main stream functional …

Although the recent popularity of parallel-computing environments has called for parallel
programs, it is difficult for nonspecialists to develop those that are efficient. What is required …

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

This paper introduces a new approach to optimizing array algorithms in functional
languages. We are specifically aiming at an efficient implementation of irregular array …