ENGLISH

Purely functional data structures

By Chris Okasaki

Book information

Publisher
Cambridge University Press
Year
1998
ISBN
9780521631242, 9780511530104, 0521663504, 0521631246, 0511530102, 9780521663502
LCC
QA76.9.D35 O35 1998
Open Library ID
OL355580M
Language
english
Format
DJVU
Filesize
2 MB (1718464 bytes)
Edition
CUP
Pages
231\231
Library
Kolxo3
DPI
400
Orientation
yes
Scanned
yes
Time added
2009-07-20 03:45:11

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.

Similar books