shopping cart
Save up to 30% on our Staff Picks
Call us:  800-878-7323 HELP
McAfee SECURE helps keep you safe from identity theft, credit card fraud, spyware, spam, viruses and online scams.
Original Essays | November 9, 2009

Jesse Bullington: IMG Abash'd the Devil Stood



I don't believe in evil. It's a word I use, certainly, because words are shortcuts and we all take the short way round from time to time, but that's... Continue »
  1. $10.49 Sale Trade Paper add to wish list

Ships free on qualified orders.
Add to Cart
$47.95
New Hardcover
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
25 Remote Warehouse Software Engineering- Programming and Languages

This title in other formats:

Purely Functional Data Structures

by Chris Okasaki

Purely Functional Data Structures Cover

Synopses & Reviews

Publisher Comments:

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.

Synopsis:

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

Synopsis:

Data structures and data structure design techniques for functional languages.

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.

Product Details

ISBN:
9780521631242
Author:
Okasaki, Chris
Publisher:
Cambridge University Press
Location:
Cambridge, U.K. ;
Subject:
Programming Languages - General
Subject:
Programming - General
Subject:
Data processing
Subject:
Data structures (computer science)
Subject:
Programming - Software Development
Subject:
Functional programming (computer science)
Subject:
Data Modeling & Design
Subject:
Functional programming languages
Subject:
Software Development & Engineering - General
Edition Description:
Includes bibliographical references and index.
Publication Date:
April 1998
Binding:
Hardcover
Grade Level:
Professional and scholarly
Language:
English
Illustrations:
Yes
Pages:
232
Dimensions:
9.32x6.26x.70 in. 1.11 lbs.

Other books you might like

  1. $14.00 Used Hardcover add to wish list
  2. $90.75 New Trade Paper add to wish list
  3. $81.50 New Hardcover add to wish list
  4. $76.25 New Trade Paper add to wish list
  5. $72.00 New Hardcover add to wish list
  6. $20.00 Used Hardcover add to wish list

Related Aisles

  • back to top

Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and eBooks — here at Powells.com.