+612 9045 4394
 
CHECKOUT
Purely Functional Data Structures - Chris Okasaki

Purely Functional Data Structures

Paperback Published: 13th June 1999
ISBN: 9780521663502
Number Of Pages: 232

Share This Book:

Paperback

$100.75
or 4 easy payments of $25.19 with Learn more
Ships in 7 to 10 business days

Other Available Editions (Hide)

  • Hardcover View Product Published: 13th April 1998
    Ships in 7 to 10 business days
    $184.80

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.

"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

Introduction
Persistence
Some familiar data structures in a functional setting
Lazy evaluation
Fundamentals of amortization
Amortization and persistence via lazy evaluation
Eliminating amortization
Lazy rebuilding
Numerical representations
Data-structural bootstrapping
Implicit recursive slowdown
Haskell source code
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780521663502
ISBN-10: 0521663504
Audience: Professional
Format: Paperback
Language: English
Number Of Pages: 232
Published: 13th June 1999
Publisher: CAMBRIDGE UNIV PR
Country of Publication: GB
Dimensions (cm): 22.8 x 15.2  x 1.5
Weight (kg): 0.39