《纯函数式数据结构》封面

纯函数式数据结构

Purely functional data structures

Chris Okasaki · 初版 1998 年

87人推荐
155位读者提及
209次提及

为什么值得读

  • 展现数系与数据结构之间令人惊叹的对应
  • 为函数式编程初学者开拓思维并提供启发
  • 书中结构与思想对当今诸多计算问题依然适用

Hacker News 上怎么说

  • ……阿贝尔森和萨斯曼的《计算机程序的构造和解释》- 塞奇威克、韦恩的《算法》- 霍普克罗夫特、莫特瓦尼、乌尔曼的《自动机理论、语言和计算导论》。没那么出名但极其有趣的书:- 克里斯·奥卡萨基的《纯函数式数据结构》(Purely Functional Data Structures)- 弗里德曼、伯德、基塞廖夫的《The Reasoned Schemer》(或者找一本好的 Prolog 书也行)。学完基础之后,你可以拓展到自己感兴趣的分支领域。(或者就像弗兰克·扎帕所说……

    …Computer Programs, Abelson and Sussman - Algorithms, Sedgewick, Wayne - Introduction to Automata Theory, Languages, and Computation, Hopcroft, Motwani, Ullman Lesser known, but incredibly fun books: - Purely Functional Data Structures, Chris Okasaki - The Reasoned Schemer, Friedman, Byrd, Kiselyov (or a good Prolog book). After learning the foundations, you could branch out to a subfield that interests you. (Or as Frank Zappa has…

  • 我原本以为克里斯·奥卡萨基的《纯函数式数据结构》会上榜的。我会推荐它,但更重要的是,我看到许多在函数式编程方面比我懂得多得多的大佬都在推它。对于……可能更有用一点

    I expected Purely Functional Data Structures by Chris Okasaki to be on this list. I would recommend it but more importantly I've seen many people who know a lot more about functional programming recommend it. It is probably a bit more useful for…

  • 强烈推荐克里斯·奥卡萨基的《纯函数式数据结构》。在我刚接触函数式编程时,它真的让我脑洞大开。对于许多现代编程问题来说,它的相关性依然极高。

    I highly recommend Purely Functional Data Structures by Chris Okasaki. It really opened my mind when I was starting out in functional programming. Highly relevant to many modern problems.

  • ……帖子。关于这个话题有很多优质资源,我在下面列了几个。当然还有很多很多。[1] https://www.amazon.com/Pearls-Functional-Algorithm-Design-Ri... [2] https://www.amazon.com/Purely-Functional-Data-Structures-Oka... [3] https://www.amazon.com/Algorithm-Design-Haskell-Richard-Bird... [4] https://www.amazon.com/Structure-Interpretation-Computer-Pro...

    …post. There are many good resources on this. I've referenced a few below. Of course there are many more. [1] https://www.amazon.com/Pearls-Functional-Algorithm-Design-Ri... [2] https://www.amazon.com/Purely-Functional-Data-Structures-Oka... [3] https://www.amazon.com/Algorithm-Design-Haskell-Richard-Bird... [4] https://www.amazon.com/Structure-Interpretation-Computer-Pro...

  • ……我自己琢磨出了一点点,但它依然超级酷。)顺便提一句,数系和树状结构之间显然存在着很深的联系。你可以在克里斯·奥卡萨基的《纯函数式数据结构》里读到更多细节。显然,每一种数系都对应着一种数据结构。例如,皮亚诺算术 = 链表,二进制数 = 二叉树,斐波那契数 = 二项堆,等等。有一篇简短的……

    …little of this out on my own, but it's still really cool.) Incidentally, there's apparently a deep connection between number systems and tree structures. You can read more about it in Chris Okasaki's Purely Functional Data Structures. Apparently, every number system corresponds to a data structure. For example, Peano arithmetic = linked lists, binary numbers = binary trees, fibonacci numbers = binomial heaps, etc. There's a short…

  • ……你可以培养自己对数据结构设计权衡取舍的直觉,以及它们为何会表现出特定的行为。学会 OCaml 之后,很多数据结构的设计就显得显而易见了。另外,推荐读读克里斯·奥卡萨基的《纯函数式数据结构》。不像(比如)CLRS(http://mitpress.mit.edu/algorithms/)那么厚,它其实是一本很薄的书。

    …you could develop your intuitions about data structure design trade-offs and what makes them behave the ways they do. After I learned OCaml, a lot of data structure design seemed obvious. Also, read _Purely Functional Data Structures_ by Chris Okasaki. Unlike (say) CLRS (http://mitpress.mit.edu/algorithms/), it's even a pretty short book.

正在加载完整评论……

键盘快捷键

/
聚焦搜索框
j / k
下一本 / 上一本
Enter
打开选中的书
Esc
关闭 / 返回
g h
回到首页
g b
值得读精选
g t
历史总榜
g r
上升最快
g l
我的书架
?
显示本帮助