Purely Functional Data Structures
Most books on data structures assume an imperative language such as C or C++. Get and download textbook Purely Functional Data Structures for free
author chris okasaki format paperback language english publication year 13 06 1999 subject computing it subject 2 computing professional programming payment shipping rates returns purely functional data structures product category books isbn 0521663504 title purely functional data structures ean 9780521663502 authors okasaki chris binding paperback publisher cambridge university press publication date 1999 06 13 pages 232 signed false first edition false dust jacket false list price msrp 31 99 h
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 Purely Functional Data Structures new edition
Download free books for Purely Functional Data Structures
Purely Functional Data Structures: Chris Okasaki
Purely Functional Data Structures (English) by Chris Okasaki Format Paperback Condition Brand New Language English Most books on data structures assume an imperative language such as C or C++. However, data structures for these languages do not always tra
Purely Functional Data Structures : Paperback : CAMBRIDGE UNIVERSITY PRESS : 9780521663502 : 0521663504 : 01 Jul 1999 : This book describes data structures and data structure design techniques for functional languages.
Purely Functional Data Structures, ISBN-13: 9780521663502, ISBN-10: 0521663504
Purely Functional Data Structures Textbook
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
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
