Logo

Purely Functional Data Structures

Large book cover: Purely Functional Data Structures

Purely Functional Data Structures
by

Publisher: Carnegie Mellon University
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

Book cover: Algorithms and Data Structures for External MemoryAlgorithms and Data Structures for External Memory
by - Now Publishers
The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.
(10857 views)
Book cover: Algorithms and Data Structures: With Applications to Graphics and GeometryAlgorithms and Data Structures: With Applications to Graphics and Geometry
by - Prentice Hall
Contents: Programming environments for motion, graphics, and geometry; Programming concepts - beyond notation; Objects, algorithms, programs; Complexity of problems and algorithms; Data structures; Interaction between algorithms and data structures.
(7911 views)
Book cover: Think Data StructuresThink Data Structures
by - Green Tea Press
This book is intended for college students in computer science and related fields. The book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercises.
(10191 views)
Book cover: The Design of Approximation AlgorithmsThe Design of Approximation Algorithms
by - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(14668 views)