Purely functional data structures

@inproceedings{Okasaki1998PurelyFD,
  title={Purely functional data structures},
  author={Chris Okasaki},
  year={1998}
}
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… CONTINUE READING

Citations

Publications citing this paper.

1,040 Citations

050'96'01'07'13'19
Citations per Year
Semantic Scholar estimates that this publication has 1,040 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-3 OF 3 REFERENCES

A lazy pure language versus impure Lisp

  • Richard S. Bird, Geraint Jones, Oege de Moor
  • http://www.comlab.ox.ac.uk/oucl/users/ geraint…
  • 1996
1 Excerpt

Haskell 1.3: A non-strict, purely functional language

  • John Peterson
  • http://haskell.cs.yale.edu/haskell-report/haskell…
  • 1996

Similar Papers

Loading similar papers…