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: Search Algorithms and ApplicationsSearch Algorithms and Applications
by - InTech
This book demonstrates the applicability of search algorithms for the purpose of developing solutions to problems that arise in a variety of domains. It is targeted to a wide group of readers: researchers, graduate students, and practitioners.
(11151 views)
Book cover: Introduction to Design Analysis of AlgorithmsIntroduction to Design Analysis of Algorithms
by - Smashwords
This book provides a complete information to the modern study of computer algorithms. It presents many concepts in a considerable depth, so that it can be understand by all levels of readers. Each and every concept is explained by suitable examples.
(7294 views)
Book cover: Data Structures and AlgorithmsData Structures and Algorithms
by - GitBook
This book is a survey of several standard algorithms and data structures. It will also introduce the methodology used to perform a formal analysis of an algorithm so that the reason behind the different implementations can be better understood.
(5688 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.
(11773 views)