Purely Functional Data Structures and over 2 million other books are available for Amazon Kindle . Learn more


or
Sign in to turn on 1-Click ordering.
Trade in Yours
For a 8.75 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
Sorry, this item is not available in
Image not available for
Colour:
Image not available

 
Start reading Purely Functional Data Structures on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Purely Functional Data Structures [Paperback]

Chris Okasaki
4.3 out of 5 stars  See all reviews (6 customer reviews)
RRP: 31.99
Price: 30.39 & FREE Delivery in the UK. Details
You Save: 1.60 (5%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In stock.
Dispatched from and sold by Amazon. Gift-wrap available.
Want it Tuesday, 22 April? Choose Express delivery at checkout. Details

Formats

Amazon Price New from Used from
Kindle Edition 15.45  
Hardcover 51.30  
Paperback 30.39  
Trade In this Item for up to 8.75
Trade in Purely Functional Data Structures for an Amazon.co.uk gift card of up to 8.75, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Learn more

Book Description

13 Jun 1999 0521663504 978-0521663502 New Ed
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.

Frequently Bought Together

Purely Functional Data Structures + Pearls of Functional Algorithm Design + The Haskell Road to Logic, Maths and Programming (Texts in Computing, Vol. 4)
Price For All Three: 81.01

Buy the selected items together


Product details

  • Paperback: 232 pages
  • Publisher: Cambridge University Press; New Ed edition (13 Jun 1999)
  • Language: English
  • ISBN-10: 0521663504
  • ISBN-13: 978-0521663502
  • Product Dimensions: 22.9 x 15 x 1.5 cm
  • Average Customer Review: 4.3 out of 5 stars  See all reviews (6 customer reviews)
  • Amazon Bestsellers Rank: 95,678 in Books (See Top 100 in Books)
  • See Complete Table of Contents

More About the Author

Discover books, learn about writers, and more.

Product Description

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

Book Description

Most books on data structures assume an imperative language. However, their data structures do not translate well to functional languages. This book describes data structures and data structure design techniques from the point of view of functional languages. It is a reference for functional programmers and a text for self-study.

Inside This Book (Learn More)
First Sentence
A distinctive property of functional data structures is that they are always persistent-updating a functional data structure does not destroy the existing version, but rather creates a new version that coexists with the old one. Read the first page
Explore More
Concordance
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:


Customer Reviews

4 star
0
2 star
0
1 star
0
4.3 out of 5 stars
4.3 out of 5 stars
Most Helpful Customer Reviews
6 of 6 people found the following review helpful
5.0 out of 5 stars Truly Outstanding 20 Aug 2009
Format:Paperback
This is one of the very best computer science books I have ever read, and one that I find myself amazed by every time I pick it up. Better yet, he includes code for all his data structures in (almost) standard ML and (in an appendix) in haskell. He presents the (often arcane) material well and the gradual revelation of the concepts means that reading it I was continually amazed by the new dimensions he could add to familiar datastructures such as lists and trees.

Very deep and highly recommended for the serious functional programmer.
Comment | 
Was this review helpful to you?
6 of 6 people found the following review helpful
5.0 out of 5 stars Must buy for any serious programmer 19 Nov 2008
By Iggy
Format:Paperback
If you are a programmer, you do not need this for your daily job.
But if you like learning new and explore more - then this book will surely open your eyes on functional programming.
It assumes that you already have some working knowledge of FP - so it won't serve you as a tutorial. But once you started doing some functional programming and want to creat larger apps, you would need to incorporate some data structures and this is the moment where you will find out that there is only one book on functional data structures... It is this one.
Comment | 
Was this review helpful to you?
2 of 2 people found the following review helpful
5.0 out of 5 stars Takes no prisoners 30 Jan 2012
Format:Paperback
I found that this exposition of data structures nothing short of masterful. Their is no superfluity in this book. Some parts require reading and rereading (sometimes for a few hours or more) so it unlikely to be a short read for most people, but a most rewarding one certainly.

A quantitative background is almost a pre-requisite here, and fluency in elementary data structures mandatory. But there again this is this books audience.

It has no competition but a second edition would be great (and ditch the SML).
Comment | 
Was this review helpful to you?
Would you like to see more reviews about this item?
Were these reviews helpful?   Let us know
ARRAY(0xa80f57e0)

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 

Search Customer Discussions
Search all Amazon discussions
   


Look for similar items by category


Feedback