Purely Functional Data Structures
简介：
大多数有关数据结构的书籍都采用命令式语言，例如C或C。但是，这些语言的数据结构并不总是能很好地转换为功能语言，例如标准ML，Haskell或Scheme。
本书从函数式语言的角度描述了数据结构，并结合实例介绍了允许程序员开发自己的函数式数据结构的设计技术。作者包括经典的数据结构，如红黑树和二项式队列，以及一系列专门为函数式语言开发的新数据结构。所有源代码都以标准ML和Haskell给出，并且大多数程序很容易适应其他函数式语言。对于使用功能语言的专业程序员来说，这个方便的参考也可以用作教程或自学。
英文简介：
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.
- 书名
- Purely Functional Data Structures
- 译名
- 纯函数式数据结构
- 语言
- 英语
- 年份
- 1998
- 页数
- 230页
- 大小
- 5.29 MB
- 标签
- 数据结构
- 下载
Purely Functional Data Structures.pdf- 密码
- 65536
最后更新：2025-04-12 23:55:35