Purely Functional Data Structures

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.

出版者:Cambridge University Press

作者:Chris Okasaki

页数:232

出版时间:1999-6-13

价格:USD 49.99

装帧:Paperback

isbn号码:9780521663502

图书标签:函数式编程数据结构FP算法计算机科学编程Programming计算机

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.

用户评价

其实是Chris Okasaki的90年代的博士论文~ “函数式算法导论”

神书，作者是性情中人

函数式 数据结构

Lazy evaluation的作用，在于帮助persistant data strucutre轻松达到wost case bound？

其实是Chris Okasaki的90年代的博士论文~ “函数式算法导论”