This article presents a compile-time analysis for tracking the size of data-structures in a
statically typed and strict functional language. This information is valuable for static checking …

We present three novel parallel scan algorithms for multi-core CPUs which do not need to fix
the number of available cores at the start, and have zero overhead compared to sequential …

Persistent homology, first developed at the beginning of the millennium, is a tool within the
field of topological data analysis. It is an extension of simplicial homology to filtrations of …

We present a massively parallel algorithm for computing persistent homology, a concept
within the field of topological data analysis, and we implement it in the purely functional …

Irregular nested data-parallelism is a powerful programming model which enables the
expression of a large class of parallel algorithms. However, it is notoriously difficult to …

We present a design pattern for composing deep learning networks in a typed, higher-order
fashion. The exposed library functions are generically typed and the composition structure …

Data-parallel array languages, like Accelerate, provide data-parallel operations as high-
level functions for which no low-level programming mastery is required. Permutation and …

Memory management plays a key role when trying to compile functional programs into
efficiently executable code. In particular when using flat representations for multi …

Matrix computations are widely used in increasing sizes and complexity in scientific
computing and engineering. But current matrix language implementations lack programmer …

We study the feasibility and performance efficiency of expressing a complex financial
numerical algorithm with high-level functional parallel constructs. The algorithm we …