Functional data structures
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 131-158
- https://doi.org/10.1007/3-540-61628-4_5
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Weight biased leftist trees and modified skip listsPublished by Springer Nature ,1996
- The design of a pretty-printing libraryPublished by Springer Nature ,1995
- Functional Pearls Efficient sets—a balancing actJournal of Functional Programming, 1993
- Real-time deques, multihead Turing machines, and purely functional programmingPublished by Association for Computing Machinery (ACM) ,1993
- Functional Pearls A symmetric set of efficient list operationsJournal of Functional Programming, 1992
- Making data structures persistentJournal of Computer and System Sciences, 1989
- The pairing heap: A new form of self-adjusting heapAlgorithmica, 1986
- A novel representation of lists and its application to the function “reverse”Information Processing Letters, 1986
- An efficient functional implementation of FIFO queuesInformation Processing Letters, 1982
- Real-time queue operations in pure LISPInformation Processing Letters, 1981