Dear Sir/Madam,
One of our authors, Chris Okasaki, has asked me to place a book
announcement on your Haskell mailing list for the paperback of his book
Purely Functional Data Structures. The announcement follows: if you have
any questions or would like to make any changes, please contact me.
Yours faithfully,
Richard Knott
Purely Functional Data Structures
Chris Okasaki
Columbia University
Most books on data structures assume an imperative language like 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 so that programmers can
develop their own functional data structures. It 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
can easily be adapted 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.
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.
1998 228 x 152 mm 230pp
0 521 63124 6 Hardback
For further information see http://www.cup.cam.ac.uk or http://www.cup.org
****************************************************************************
Richard Knott
STM Marketing Dept.
Cambridge University Press
The Edinburgh Building
Cambridge CB2 2RU, UK
email:[EMAIL PROTECTED]
tel: ++44 (0)1223 325916
fax: ++44 (0)1223 315052
Web: http://www.cup.cam.ac.uk
****************************************************************************
