passa ai contenuti
Purely functional data structures Anteprima di questo documento
ChiudiAnteprima di questo documento
Stiamo controllando…

Purely functional data structures

Autore: Chris Okasaki
Editore: Cambridge, U.K. ; New York : Cambridge University Press, 1998.
Edizione/Formato:   eBook : Document : EnglishVedi tutte le edizioni e i formati
Banca dati:WorldCat
Sommario:
"Most books on data structures assume an imperative language like 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 so that programmers can develop their own functional data structures. It  Per saperne di più…
Voto:

(non ancora votato) 0 con commenti - Diventa il primo.

Soggetti
Altri come questo

 

Trova una copia online

Collegamenti a questo documento

Trova una copia in biblioteca

&AllPage.SpinnerRetrieving; Stiamo ricercando le biblioteche che possiedono questo documento…

Dettagli

Tipo materiale: Document, Risorsa internet
Tipo documento: Internet Resource, Computer File
Tutti gli autori / Collaboratori: Chris Okasaki
ISBN: 9781139811743 1139811746 9780511530104 0511530102
Numero OCLC: 851148998
Note: Titre de l'écran-titre (visionné le 10 avril 2013).
Descrizione: 1 online resource (1 texte électronique (x, 220 p.)) ill., fichiers HTML et PDF.
Contenuti: Introduction --
Persistence --
Some familiar data structures in a functional setting --
Lazy evaluation --
Fundamentals of amortization --
Amortization and persistence via lazy evaluation --
Eliminating amortization --
Lazy rebuilding --
Numerical representations --
Data-structural bootstrapping --
Implicit recursive slowdown --
Appendix : A Haskell source code.
Responsabilità: Chris Okasaki.

Abstract:

"Most books on data structures assume an imperative language like 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 so that programmers can develop their own functional data structures. It 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 can easily be adapted 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."--Couv.

Commenti

Commenti degli utenti
Recuperando commenti GoodReads…
Stiamo recuperando commenti DOGObooks

Etichette

Diventa il primo.
Conferma questa richiesta

Potresti aver già richiesto questo documento. Seleziona OK se si vuole procedere comunque con questa richiesta.

Dati collegati


<http://www.worldcat.org/oclc/851148998>
library:oclcnum"851148998"
library:placeOfPublication
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:MediaObject
rdf:typeschema:Book
rdf:valueUnknown value: dct
schema:about
schema:about
schema:about
schema:about
schema:about
schema:bookFormatschema:EBook
schema:creator
schema:datePublished"1998"
schema:description"Introduction -- Persistence -- Some familiar data structures in a functional setting -- Lazy evaluation -- Fundamentals of amortization -- Amortization and persistence via lazy evaluation -- Eliminating amortization -- Lazy rebuilding -- Numerical representations -- Data-structural bootstrapping -- Implicit recursive slowdown -- Appendix : A Haskell source code."
schema:description""Most books on data structures assume an imperative language like 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 so that programmers can develop their own functional data structures. It 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 can easily be adapted 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."--Couv."
schema:exampleOfWork<http://worldcat.org/entity/work/id/559048>
schema:inLanguage"en"
schema:name"Purely functional data structures"
schema:numberOfPages"220"
schema:publication
schema:publisher
schema:url<http://proquest.safaribooksonline.com/?uiCode=univlaval&xmlId=9780521631242>
schema:workExample
schema:workExample
wdrs:describedby

Content-negotiable representations

Chiudi finestra

Per favore entra in WorldCat 

Non hai un account? Puoi facilmente crearne uno gratuito.