Amazon cover image
Image from Amazon.com

Purely functional data structures / Chris Okasaki.

By: Okasaki, ChrisMaterial type: TextTextPublication details: Cambridge, U.K. ; New York : Cambridge University Press, 1998. Description: 1 online resource (x, 220 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9781139811743; 1139811746; 9780511530104; 0511530102; 0511825137; 9780511825132; 9781283870801; 1283870800Subject(s): Data structures (Computer science) | Functional programming languages | COMPUTERS -- Data Processing | Data structures (Computer science) | Functional programming languages | Standard ML | Datenstruktur | Funktionale Programmiersprache | Datastructuren | Functionele programmering | Structures de données (informatique) | Langages de programmation fonctionnelleGenre/Form: Electronic books. | Electronic books. Additional physical formats: Print version:: Purely functional data structures.DDC classification: 005.7/3 LOC classification: QA76.9.D35 | O35 1998ebOther classification: 54.51 | ST 245 | ST 250 M57 | DAT 455f | DAT 544f Online resources: Click here to access online
Contents:
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: Haskell source code.
Review: "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."--Jacket.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

Includes bibliographical references and index.

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

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: Haskell source code.

Print version record.

Powered by Koha