Most books on data structures assume the use of an imperative programming language, such as C/C++ or Java. However, implementations of data structures in such languages do not always transfer well to functional programming languages such as Standard ML, Haskell or Scheme. This book describes data structures from the perspective of functional languages, provides examples, and provides design approaches that developers can use to create their own data structures. The book includes both classic data structures, for example, red-black trees and binomial queues, as well as some new data structures created specifically for functional languages. All source code is provided in Standard ML and Haskell, and most programs can be easily adapted for other functional programming languages.

This publication is a reference guide for professional programmers working with functional languages and can also be used as a textbook for self-study.