Compact List Representation: Definition,
Garbage Collection, and System Implementation

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.

CACM September, 1969

Hansen, W. J.

data structure, data representation, list structure,
list representation, list, compact list, garbage 
collection, relocation, storage reclamation, macro,
primitive list operations, plex processing, plex, 
pointer, list processing system, LISP, free storage

3.49 4.20 4.22 4.49 4.9

CA690902 JB February 15, 1978  5:01 PM

1853	4	1853
2003	4	1853
1710	5	1853
1853	5	1853
1853	5	1853
1853	5	1853
1972	5	1853
2249	5	1853
2736	5	1853
3074	5	1853
1626	6	1853
1626	6	1853
1708	6	1853
1826	6	1853
1826	6	1853
1826	6	1853
1853	6	1853
1853	6	1853
1853	6	1853
1853	6	1853
1972	6	1853
1972	6	1853
2723	6	1853