The majority of data structure literature presupposes an imperative language, such as C or C++. However, functional languages like Standard ML, Haskell, or Scheme do not always transfer these languages' data structures well.
This book provides examples that illustrate data structures from the perspective of functional languages and design strategies that enable programmers to create their own functional data structures. The author provides a variety of brand-new data structures created specifically for functional languages, as well as traditional data structures like red-black trees and binomial queues.
The source code for every program is provided in Standard ML and Haskell, and the majority of them may be simply translated into other functional languages. This useful resource for functional language programmers working in the industry can be utilized as a tutorial or for independent study.