Purely Functional Data Structures

封面
Cambridge University Press, 1998年4月13日
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.
 

讀者評論 - 撰寫評論

我們找不到任何評論。

已選取的頁面

內容

Preface
Lazy Evaluation
6
8
Implicit Recursive Slowdown
A Haskell Source Code
Bibliography
版權所有

其他版本 - 查看全部

常見字詞

書目資訊