An Overview of Edison

An Overview of Edison (2000)

by Chris Okasaki

Venue:	Electronic Notes in Theoretical Computer Science
Citations:	14 - 0 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	An Overview of Edison	SVM HeaderParse 0.1
AUTHOR NAME	Chris Okasaki	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; Columbia University	SVM HeaderParse 0.2
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 inuenced by details of Haskell. 1 Introduction There is a growing recognition that a useful set of libraries is at least as important to the acceptance of a programming language as the design of the language itself. A library of fundamental data structures such as queues, sets, and nite maps is particularly important in this regard. However, high-quality examples of such libraries, such as the STL [14] in C++ or the the collection classes [3] in Smalltalk, are rare. Edison is a library of ecient data structures suitable for implementation and use in functional programming languages. It is named after Thomas Alva Edison and for the mnemonic value of EDiSon (Ecient Data ...	user correction - Legacy Corrections
YEAR	2000	INFERENCE
VENUE	Electronic Notes in Theoretical Computer Science	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	34--54	INFERENCE
VOLUME	41	INFERENCE
CITATIONS	14 found	ParsCit 1.0