The variable cell length listprocessor VARLIST

A listprocessing system which allows assignment of cells of any length, expressed in a discrete number of computer words, is proposed for a wider range of problems than just for the algebraic manipulation systems for which it was designed. Erasure of lists is done while preserving contiguity of space by means of an internal and external linkage technique. A compacting routine which copies used blocks into empty blocks can be applied provided that the liststructures have a canonical form which can be identified through the type field so that all pointers can be accessed for readdressing. An application program outside the mathematical area is discussed.