**Purely Functional Data Structures**

by Chris Okasaki

**Publisher**: Carnegie Mellon University 1996**ISBN/ASIN**: 0521663504**Number of pages**: 162

**Description**:

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.

Download or read it online here:

**Download link**

(620KB, PDF)

## Similar books

**Randomized Algorithms**

by

**Wolfgang Merkle**-

**ESSLLI**

The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models.

(

**4820**views)

**Problems on Algorithms, 2nd edition**

by

**Ian Parberry, William Gasarch**-

**Prentice Hall**

A collection of problems on the design, analysis, and verification of algorithms for practicing programmers who wish to hone and expand their skills, as a supplementary text for students, and as a self-study text for graduate students.

(

**10504**views)

**Elementary Algorithms**

by

**Larry LIU Xinyu**-

**Github**

'Elementary Algorithms' is a free book about elementary algorithms and data structures. This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures.

(

**372**views)

**A=B**

by

**Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger**-

**AK Peters, Ltd.**

The book shows how some computer algorithms can simplify complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory, and the principle theorems and proofs.

(

**17298**views)