Purely functional data structures chris okasaki september 1996 cmu cs 96 177 school of computer science carnegie mellon university pittsburgh pa 15213 submitted in partial fulfillment of the requirements for the degree of doctor of philosophy thesis committee peter lee chair robert harper daniel sleator robert tarjan princeton university . This book explains how to build purely functional data structure that is persistent structures that are not directly modified but rather copied and rebuild chris explains how to use lazy evaluation and other advanced functional techniques in order to reconcile functional programming and efficiency. Since chris okasakis 1998 book purely functional data structures i havent seen too many new exciting purely functional data structures appear i can name just a few intmap also invented by okasaki in 1998 but not present in that book finger trees and their generalization over monoids. User review flag as inappropriate this is a great book an improved version of okasakis phd thesis the book introduces the reader to the notion of efficient data structures which still get to be purely functional ie not imperative no side effects a common problem with purely functional data structures is that since there is no state we cant change the value of a variable once it
How it works:
1. Register a Free 1 month Trial Account.
2. Download as many books as you like ( Personal use )
3. No Commitment. Cancel anytime.
4. Join Over 100.000 Happy Readers.
5. That's it. What you waiting for? Sign Up and Get Your Books.