omitir hasta el contenido
Purely functional data structures Ver este material de antemano
CerrarVer este material de antemano
Chequeando…

Purely functional data structures

Autor: Chris Okasaki
Editorial: Cambridge, U.K. ; New York : Cambridge University Press, 1998.
Edición/Formato:   Libro-e : Documento : Inglés (eng)Ver todas las ediciones y todos los formatos
Base de datos:WorldCat
Resumen:
"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  Leer más
Calificación:

(todavía no calificado) 0 con reseñas - Ser el primero.

Temas
Más materiales como éste

 

Encontrar un ejemplar en línea

Enlaces a este material

Encontrar un ejemplar en la biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que tienen este material…

Detalles

Tipo de material: Documento, Recurso en Internet
Tipo de documento: Recurso en Internet, Archivo de computadora
Todos autores / colaboradores: Chris Okasaki
ISBN: 9781139811743 1139811746 9780511530104 0511530102
Número OCLC: 851148998
Notas: Titre de l'écran-titre (visionné le 10 avril 2013).
Descripción: 1 online resource (1 texte électronique (x, 220 p.)) ill., fichiers HTML et PDF.
Contenido: 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.
Responsabilidad: Chris Okasaki.

Resumen:

"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.

Reseñas

Reseñas contribuidas por usuarios
Recuperando reseñas de GoodReads…
Recuperando reseñas de DOGObooks…

Etiquetas

Ser el primero.
Confirmar este pedido

Ya ha pedido este material. Escoja OK si desea procesar el pedido de todos modos.

Datos enlazados


<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

Cerrar ventana

Inicie una sesión con WorldCat 

¿No tienes una cuenta? Puede fácilmente crear una cuenta gratuita.