General-purpose algorithms and data structures, illustrated in Haskell. Part II Reflection without Remorse: A conceptual sequence as a tangible and efficient data structure Pure functional, mutation-free, efficient double-linked lists Total stream processors and their applications to all infinite streams Sparse Grids: multi-dimensional interpolation, approximation and integration Fast computation