An Overview of Edison (2000) [9 citations — 0 self]
Download:
|
|
by Chris Okasaki
Electronic Notes in Theoretical Computer Science
http://www.cs.nott.ac.uk/~gmh/papers/5.ps
Add To MetaCart
Abstract:
Edison is a library of functional data structures implemented in Haskell. It supports three main families of abstractions: sequences, collections (e.g., sets and priority queues), and associative collections (e.g., nite maps). This paper summarizes the design of Edison, with particular attention to how that design is in uenced by details of Haskell. 1
Citations
| 191 | The Standard Template Library – Stepanov, Lee - 1995 |
| 149 | Purely Functional Data Structures – Okasaki - 1998 |
| 134 | QuickCheck: a lightweight tool for random testing of Haskell programs – Claessen, Hughes - 2000 |
| 71 | Type classes: an exploration of the design space – Jones, Jones, et al. - 1997 |
| 37 | Self-adjusting heaps – Sleator, Tarjan - 1986 |
| 15 | An efficient functional implementation of FIFO queues – Burton - 1982 |
| 15 | Purely functional random-access lists – Okasaki - 1995 |
| 13 | Fast mergeable integer maps – Okasaki, Gill - 1998 |
| 11 | An applicative random-access stack – Myers - 1983 |
| 8 | Bulk types with class – Jones - 1996 |
| 7 | Searching and sorting, volume 3 of The art of computer programming – Knuth - 1973 |
| 4 | Three algorithms on Braun trees – Okasaki - 1997 |
| 3 | Interfaces and Speci for the Smalltalk-80 Collection Classes – Cook - 1992 |
| 2 | A logarithmic implementation of arrays – Hoogerwoord - 1992 |
