Purely Functional Representations of Catenable Sorted Lists

@inproceedings{Kaplan1996PurelyFR,
  title={Purely Functional Representations of Catenable Sorted Lists},
  author={Haim Kaplan and Robert E. Tarjan},
  booktitle={STOC},
  year={1996}
}
The power of purely functional programming in the construction of data structures has received much attention, not only because functional languages have many desirable properties, but because structures built purely functionally are automatically fully persistent: any and all versions of a structure can coexist inde nitely. Recent results illustrate the surprising power of pure functionality. One such result was the development of a representation of double-ended queues with catenation that… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS

Similar Papers

Loading similar papers…