BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Purely Functional Data Structures (Volume 0)

Purely Functional Data Structures (Volume 0)

Purely Functional Data Structures (Volume 0)
Stock photo: cover may vary

Purely Functional Data Structures (Volume 0) Paperback - 1999

by Okasaki, Chris

Add to wish list
  • Used
  • very good
  • first
Used - Very good

Description

Cambridge University Press. 1. Very Good. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.
Ask the seller a question Add to wish list
A$44.05
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Ships from BooksRun (Pennsylvania, United States)

Details

  • Title Purely Functional Data Structures (Volume 0)
  • Author Okasaki, Chris
  • Binding Paperback
  • Edition 1
  • Condition Used - Very good
  • Pages 232
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press
  • Publication date 1999-06-13
  • Bookseller's Inventory # 0521663504-8-1
  • ISBN 9780521663502 / 0521663504
  • Weight 0.85 lbs (0.39 kg)
  • Dimensions 9 x 5.9 x 0.6 in (22.86 x 14.99 x 1.52 cm)
  • Category Computers - Languages / Programming
  • Library of Congress Catalogue Number 98015367
  • Dewey Decimal Code 005.73
  • Quantity available 1

About BooksRun Pennsylvania, United States

Specialising in: Textbooks
Biblio member since 2016

BooksRun - best place to buy, sell or rent cheap textbooks

Terms of Sale:

30 days return guarantee. 10% restocking fee applies to discretionary returns

Browse books from BooksRun

Reader reviews for Purely Functional Data Structures (Volume 0)

From the publisher

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.
tracking-