Purely Functional Data Structures

Purely Functional Data Structures

Paperback

By (author) Chris Okasaki

$48.38
List price $54.98
You save $6.60 12% off

Free delivery worldwide
Available
Dispatched in 4 business days
When will my order arrive?

Additional formats available

Format
Hardback $91.46
  • Publisher: CAMBRIDGE UNIVERSITY PRESS
  • Format: Paperback | 232 pages
  • Dimensions: 152mm x 226mm x 20mm | 386g
  • Publication date: 1 July 1999
  • Publication City/Country: Cambridge
  • ISBN 10: 0521663504
  • ISBN 13: 9780521663502
  • Sales rank: 119,704

Product description

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.

Other people who viewed this bought:

Showing items 1 to 10 of 10

Other books in this category

Showing items 1 to 11 of 11
Categories:

Review quote

"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

Table of contents

1. Introduction; 2. Persistence; 3. Some familiar data structures in a functional setting; 4. Lazy evaluation; 5. Fundamentals of amortization; 6. Amortization and persistence via lazy evaluation; 7. Eliminating amortization; 8. Lazy rebuilding; 9. Numerical representations; 10. Data-structural bootstrapping; 11. Implicit recursive slowdown; Appendix: Haskell source code.