Minimal overhead garbage collection of complex list structure

A method is described for keeping track of list cells and other objects so that they may be returned to free storage when they are no longer referenced. The method uses only one bit per reference and no searching.