Purely Functional Data Structures
Ranked #2 in Data Structures, Ranked #39 in Haskell — see more rankings.
Most books on data structures assume an imperative language such as C or C++. However, data structures for these languages do not always translate well to functional languages such as Standard ML, Haskell, or Scheme. This book describes data structures from the point of view of functional languages, with examples, and presents design techniques that allow programmers to develop their own functional data structures. The author includes both classical data structures, such as red-black trees and binomial queues, and a host of new data structures developed exclusively for functional languages.... more
Rankings by Category
Purely Functional Data Structures is ranked in the following categories:
- #46 in Algorithms
- #80 in Computer Science
Similar Books
If you like Purely Functional Data Structures, check out these similar top-rated books:
