Purely Functional Data Structures

Chris Okasaki

ISBN 10: 0521663504 / ISBN 13: 9780521663502

Published by Cambridge University Press, GB, 1999

Most books on data structures assume an imperative language like C or C++. However, data structures for these languages do not always translate well to functional languages such as Standard ML, Haskell, or Scheme. This book describes data structures from the point of view of functional languages, with examples, and presents design techniques so that programmers can develop their own functional data structures. It 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. All source code is given in Standard ML and Haskell, and most of the programs can easily be adapted to other functional languages. This handy reference for professional programmers working with functional languages can also be used as a tutorial or for self-study. Seller Inventory # LU-9780521663502

Synopsis:

This book describes data structures and data structure design techniques for functional languages.

Review: "This book is important because it presents data structures from the point of view of functional languages...a handy reference for professional functional programmers...Most of the programs can easily be adapted to other functional languages. Even C and Java programmers should find implementing these data structures a relatively straightforward process...Programs are physically well structured and readable, and are displayed in boxes. Okasaki has produced a valuable book about functional programming, exploring a wide range of data structures...a significant contribution to the computer science literature." Computing Reviews

Bibliographic Details

Title: Purely Functional Data Structures
Publisher: Cambridge University Press, GB
Publication Date: 1999
Binding: Paperback
Condition: New