The variable cell length listprocessor VARLIST

Authors:
Dorothea A. Klip
Affiliations:
-
Venue:
ACM '74 Proceedings of the 1974 annual conference - Volume 1
Year:
1974

Citing 5
Cited 1

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Copying list structures using bounded workspace

Communications of the ACM
List tracing in systems allowing multiple cell-types

Communications of the ACM
Symmetric list processor

Communications of the ACM
Different polynomial representations and their interaction in the portable algebra system PORT-ALG

ACM SIGSAM Bulletin

Different polynomial representations and their interaction in the portable algebra system PORT-ALG

ACM SIGSAM Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.