Many algorithms can be elegantly implemented in a functional programming language like Haskell. The idea of the projects in this theme is to take one or more well know algorithms, and implement them in Haskell. For example, you can think of implementing the Burrows Wheeler transform (a fast and good compression algorithm). Besides an implementation of the algorithm, you'll very often have to build a library for general functionality as well.
Projects examples: implementation of fast and good compression algorithms.
Contact: Johan Jeuring