The New York Times Best Sellers Fiction, 30th Mar 2014



Download Free eBooks & Tutorials in PDF & Other Formats

Cheap domain name registration, renewal transfers

Purely Functional Data Structures
Author(s): Chris Okasaki
Publisher: Cambridge University Press
Date: 1999
Pages: 230
Format: PDF
Language: English
ISBN-10: 0521663504
ISBN-13: 978-0521663502
Size: 5.51 MB

Description:


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.

Links to Download or Buy:


If you can afford, then please support the Author/s by Buying the book.

Buy

or
Download from:

Uploaded Turobit

Multi-Mirror Links:


Above links not working? Check out these Multi-Mirror links.

Mirror Creator ExoShare

Embed Upload Multi Upload

Torrent:


What? None of the links work?
Don't worry, we are here for the rescue. Check out the torrent :)

Torrent


What?
What is a Torrent?
Don't know how to download from Torrent? Have a look at this short tutorial and please don't forget to seed the Torrent :)


Link Dead? Check out the Surprise.



Like the Book? Kindly Bookmark and Share it.

Technorati Digg This Stumble Reddit Facebook Twitter

0 comments:

Post a Comment


:a   :b   :c   :d   :e   :f   :g   :h   :i   :j   :k   :l   :m   :n   :o   :p   :q   :r   :s   :t