๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Purely functional data structures

โœ Scribed by Okasaki, Chris


Publisher
Cambridge University Press
Year
2003
Tongue
English
Leaves
232
Edition
1st
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


Data structures and data structure design techniques for functional languages.

โœฆ Table of Contents


  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

โœฆ Subjects


Datenstruktur -- Funktionale Programmiersprache;Datenstruktur;Funktionale Programmiersprache;Standard ML;Data structures (Computer science);Functional programming languages


๐Ÿ“œ SIMILAR VOLUMES


Purely Functional Data Structures
โœ Chris Okasaki ๐Ÿ“‚ Library ๐Ÿ“… 1998 ๐Ÿ› Cambridge University Press ๐ŸŒ English

This book is great for someone who already understands the basics of functional programming but wants to learn more. I should note that terseness is one of this book's greatest strong points. In other words, don't assume that just because the book is short that it will be a short read. There's ju

Purely Functional Data Structures
โœ Chris Okasaki ๐Ÿ“‚ Library ๐Ÿ“… 1998 ๐Ÿ› Cambridge University Press ๐ŸŒ English

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, wi

Purely functional data structures
โœ Chris Okasaki ๐Ÿ“‚ Library ๐Ÿ“… 1999 ๐Ÿ› Cambridge University Press ๐ŸŒ English

Most books on data structures assume an imperative language such as 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,