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 for free here:
Download link
(620KB, PDF)
Similar books
Elementary Algorithmsby 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.
(9002 views)
Algorithms for Modular Elliptic Curvesby J. E. Cremona - Cambridge University Press
The author describes the construction of modular elliptic curves giving an algorithm for their computation. Then algorithms for the arithmetic of elliptic curves are presented. Finally, the results of the implementations of the algorithms are given.
(17644 views)
Algorithmsby Robert Sedgewick, Kevin Wayne - Addison-Wesley Professional
This textbook surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm by examining its impact on specific applications.
(12865 views)
Modern Computer Arithmeticby Richard P. Brent, Paul Zimmermann - LORIA
This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.
(15263 views)