Publication View

Purely Functional Data Structures (1998)

Abstract
When a C programmer needs an efficient data structure for a particular problem, he or she can often simply look one up in any of a number of good textbooks or handbooks. Unfortunately, programmers in functional languages such as Standard ML or Haskell do not have this luxury. Although some data structures designed for imperative languages such as C can be quite easily adapted to a functional setting, most cannot, usually because they depend in crucial ways on assignments, which are disallowed, or at least discouraged, in functional languages.

Publication details
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.505
Source http://www.cs.cmu.edu/afs/cs/project/fox/mosaic/papers/cokasaki-thesis.ps
Publisher Cambridge University Press
Contributors CiteSeerX
Repository CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Keywords functional programming, data structures, lazy evaluation, amortization For Maria
Type text
Language English