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 devel...
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.
作者简介
· · · · · ·
Dr. Okasaki spent three years at Columbia University as an Assistant Professor of Computer Science, where he taught courses in programming languages and advanced data structures. He has also worked as a visiting researcher at the University of Glasgow, and as a consultant for an Internet startup company, developing a compiler for their agent control language. His primary resear...
Dr. Okasaki spent three years at Columbia University as an Assistant Professor of Computer Science, where he taught courses in programming languages and advanced data structures. He has also worked as a visiting researcher at the University of Glasgow, and as a consultant for an Internet startup company, developing a compiler for their agent control language. His primary research interests are programming languages and algorithms. He is especially interested in the combination of these two areas, considering questions of how the details of a programming language affect the implementation and efficiency of algorithms.
目录
· · · · · ·
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
· · · · · ·
(更多)
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
· · · · · · (收起)
fun insert (x, s) =
let fun ins E = T (R, E, x, E)
| ins (s as T (color, a, y, b) =
if x < y then balance (color, ins a, y, b)
else if x > y then balance (color, a, y, ins b)
else s
val T (_, a, y, b) = ins s (* guaranteed to be non-empty *)
in T (B, a, y, b) end (查看原文)
5 有用 寒栗 2013-05-18 18:19:22
一想到这本书不是因为听说而是自己搜出来读的就倍感欣慰
4 有用 少年阿猫 2014-02-24 14:13:06
妈妈的，看得老子掉头发
4 有用 Duke 2018-05-11 02:57:42
如何在函数式数据结构里做删除真是永恒的难题：）
2 有用 咚touch her 2019-03-24 20:10:31
感觉以我现在的薪资水平用不上（没错我就是给1毛钱出6分力的中年混子）
1 有用 lispc 2013-08-26 14:33:49
wonderful