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: Fundamental TechniquesAlgorithms: Fundamental Techniques
by - Wikibooks
An accessible introduction into the design and analysis of efficient algorithms. It explains only the most basic techniques, and gives intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.
(11272 views)
Book cover: Algorithmic MathematicsAlgorithmic Mathematics
by - Queen Mary University of London
This text is a course in mathematical algorithms, intended for second year mathematics students. It introduces the algorithms for computing with integers, polynomials and vector spaces. The course requires no computing experience.
(14970 views)
Book cover: Problem Solving with Algorithms and Data Structures Using PythonProblem Solving with Algorithms and Data Structures Using Python
by - Franklin, Beedle & Associates
This textbook is designed as a text for a first course on data structures and algorithms, taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.
(6407 views)
Book cover: Notes on Data Structures and Programming TechniquesNotes on Data Structures and Programming Techniques
by - Yale University
Topics include programming in C; data structures (arrays, stacks, queues, lists, trees, heaps, graphs); sorting and searching; storage allocation and management; data abstraction; programming style; testing and debugging; writing efficient programs.
(2191 views)