Purely Functional Data Structures (1ST ed.)(快遞進口)
Okasaki
- 出版商: Cambridge
- 出版日期: 1999-06-13
- 售價: $2,500
- 貴賓價: 9.5 折 $2,375
- 語言: 英文
- 頁數: 232
- 裝訂: Paperback
- ISBN: 0521663504
- ISBN-13: 9780521663502
-
相關分類:
Algorithms-data-structures
海外代購書籍(需單獨結帳)
買這商品的人也買了...
-
$2,540$2,413 -
$570$559 -
$950$931 -
$2,030$1,929 -
$2,200$2,090 -
$1,860$1,767 -
$2,200$2,090 -
$1,723$1,637 -
$1,860$1,767 -
$980$833 -
$780$616 -
$980$774 -
$2,100$1,995 -
$360$284 -
$390$257 -
$520$411 -
$560$476 -
$520$411 -
$450$356 -
$500$390 -
$580$458 -
$699$594 -
$400$312 -
$500$395 -
$780$616
相關主題
商品描述
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.