Purely Functional Data Structures

Purely Functional Data Structures

eBook - 1998
Rate this:
"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."--Jacket.
Publisher: Cambridge, U.K. ; New York : Cambridge University Press, 1998
ISBN: 9781139811743
1139811746
9780511530104
0511530102
9780511825132
0511825137
0521631246
9780521631242
0521663504
9780521663502
9780511825132
Characteristics: 1 online resource (x, 220 pages) : illustrations

Opinion

From the critics


Community Activity

Comment

Add a Comment

There are no comments for this title yet.

Age Suitability

Add Age Suitability

There are no age suitabilities for this title yet.

Summary

Add a Summary

There are no summaries for this title yet.

Notices

Add Notices

There are no notices for this title yet.

Quotes

Add a Quote

There are no quotes for this title yet.

Explore Further

Recommendations

Subject Headings

  Loading...

Find it at WPL

  Loading...
[]
[]
To Top