Fundamentals of data structures in PASCAL
Fundamentals of data structures in PASCAL
Design for a multiprocessing heap with on-board reference counting
Proc. of a conference on Functional programming languages and computer architecture
Garbage collection can be faster than stack allocation
Information Processing Letters
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Lively linear Lisp: “look ma, no garbage!”
ACM SIGPLAN Notices
Stop-and-copy and one-bit reference counting
Information Processing Letters
Static analysis for optimizing reference counting
Information Processing Letters
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
List processing in real time on a serial computer
Communications of the ACM
Communications of the ACM
An efficient, incremental, automatic garbage collector
Communications of the ACM
More on the reference counter method of erasing list structures
Communications of the ACM
Symbol manipulation by threaded lists
Communications of the ACM
A method for overlapping and erasure of lists
Communications of the ACM
Communications of the ACM
Data Structure Techniques
Data Structures and Their Algorithms
Data Structures and Their Algorithms
Research Demonstration of a Hardware Reference-Counting Heap
Lisp and Symbolic Computation
One-bit counts between unique and sticky
Proceedings of the 1st international symposium on Memory management
| Hi-index | 0.00 |
Identifying some pointers as invisible threads, for the purposes of storage management, is a generalization from several widely used programming conventions, like threaded trees. The necessary invariant is that nodes that are accessible (without threads) emit threads only to other accessible nodes. Dynamic tagging or static typing of threads ameliorates storage recycling both in functional and imperative languages.We have seen the distinction between threads and links sharpen both hardware- and software-supported storage management in SCHEME, and also in C. Certainly, therefore, implementations of languages that already have abstract management and concrete typing, should detect and use this as a new static type.