Author: Okasaki, Chris
Title: Purely Functional Data Structures
Description: Cambridge, Cambridge University Press, 1998. orig.cloth. 24x15cm, x,220 pp. A label to rear cover. Some rubbing. VG. ¶ Contents: Introduction; Persistence; Some familiar data structures in a functional setting; Lazy evaluation; Fundamentals of amortization; Amortization and persistence via lazy evaluation; Eliminating amortization;Lazy rebuilding; Numerical representations; Data-structural bootstrapping; Implicit recursive slowdown; Appendix: Haskell source code. ["Most books on data structures assume an imperative language like 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 so that programmers can develop their own functional data structures. It 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. All source code is given in Standard ML and Haskell, and most of the programs can easily be adapted to other functional languages. This handy reference for professional programmers working with functional languages can also be used as a tutorial or for self-study." - Publisher's description]

Keywords: Computer Science, Functional, Programming, Data Structures, , , , ,