Cantitate/Preț
Produs

Purely Functional Data Structures

De (autor)
Notă GoodReads:
en Limba Engleză Paperback – 13 Jun 1999
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.
Citește tot Restrânge
Toate formatele și edițiile
Toate formatele și edițiile Preț Express
Paperback (1) 28649 lei  22-33 zile +650 lei  6-12 zile
  Cambridge University Press – 13 Jun 1999 28649 lei  22-33 zile +650 lei  6-12 zile
Hardback (1) 40499 lei  43-55 zile +14891 lei  12-20 zile
  Cambridge University Press – 13 Apr 1998 40499 lei  43-55 zile +14891 lei  12-20 zile

Preț: 28649 lei

Puncte Express: 430

Preț estimativ în valută:
5514 5268$ 4928£

Carte disponibilă

Livrare economică 21 octombrie-01 noiembrie
Livrare express 05-11 octombrie pentru 1649 lei

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521663502
ISBN-10: 0521663504
Pagini: 232
Ilustrații: Illustrations
Dimensiuni: 153 x 227 x 18 mm
Greutate: 0.39 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării: Cambridge, United Kingdom

Public țintă

Academic/professional/technical: Research and professional

Cuprins

1. Introduction; 2. Persistence; 3. Some familiar data structures in a functional setting; 4. Lazy evaluation; 5. Fundamentals of amortization; 6. Amortization and persistence via lazy evaluation; 7. Eliminating amortization; 8. Lazy rebuilding; 9. Numerical representations; 10. Data-structural bootstrapping; 11. Implicit recursive slowdown; Appendix: Haskell source code.

Recenzii

"This book is important because it presents data structures from the point of view of functional languages...a handy reference for professional functional programmers...Most of the programs can easily be adapted to other functional languages. Even C and Java programmers should find implementing these data structures a relatively straightforward process...Programs are physically well structured and readable, and are displayed in boxes. Okasaki has produced a valuable book about functional programming, exploring a wide range of data structures...a significant contribution to the computer science literature." Computing Reviews