Purely Functional Data Structures |  | Author: Chris Okasaki
Publisher: Cambridge University Press
Category: Book
List Price: $53.00
Buy New: $36.98
as of 5/22/2012 04:42 MDT details
You Save: $16.02 (30%)
New (25) Used (18) from $33.99
Seller: LABYRINTH BOOKS
Sales Rank: 149,132
Languages: English (Unknown), English (Original Language), English (Published)
Media: Paperback
Pages: 232
Number Of Items: 1
Shipping Weight (lbs): 0.7
Dimensions (in): 0.9 x 0.6 x 0.1
ISBN: 0521663504
EAN: 9780521663502
ASIN: 0521663504
Publication Date: June 13, 1999
Availability: Usually ships in 1-2 business days
| |
| Also Available In:
|
| Similar Items:
| |
| Editorial Reviews:
Product Description
Most books on data structures assume an imperative language such as 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 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. All source code is given in Standard ML and Haskell, and most of the programs are easily adaptable 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.
|
| |
|
|
|
