Compact list representation
Wilfred J. Hansen · Communications of the ACM · 1969
Compact lists are stored sequentially in memory, rather than chained with pointers. Since this is not always convenient, the Swym system permits a list to be chained, compact, or any combination of the two. A description is given of that list representation and the operators implemented (most are similar to those of LISP 1.5). The system garbage collector attempts to make all lists compact; it relocates and rearranges all of list storage using temporary storage. This unique list-compacting garbage collection algorithm is presented in detail. Several classes of the macros used to implement the system are described. Finally, consideration is given to those design factors essential to the success of a plex processing system implementation.
Cited by 46 works. doi:10.1145/363219.363225 Open-access PDF
Authors
References
- The Art of Computer Programming
- LISP 1.5 PROGRAMMER'S MANUAL
- A generalized technique for symbol manipulation and numerical calculation
- A LISP Garbage Collector Algorithm Using Serial Secondary Storage
- Compound data structure for computer aided design; a survey
- An efficient machine-independent procedure for garbage collection in various list structures
- The AED free storage package
- Programming Techniques: ASP—a ring implemented associative structure package
- COGENT--PROGRAMMING MANUAL
- The impact of storage management on plex processing language implementation