Compact list representation
- 1 September 1969
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 12 (9) , 499-507
- https://doi.org/10.1145/363219.363225
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Programming Techniques: ASP—a ring implemented associative structure packageCommunications of the ACM, 1968
- An efficient machine-independent procedure for garbage collection in various list structuresCommunications of the ACM, 1967
- The AED free storage packageCommunications of the ACM, 1967
- Compound data structure for computer aided design; a surveyPublished by Association for Computing Machinery (ACM) ,1967
- LISP 1.5 PROGRAMMER'S MANUALPublished by Defense Technical Information Center (DTIC) ,1962
- A generalized technique for symbol manipulation and numerical calculationCommunications of the ACM, 1961