List-tracing in systems allowing multiple cell-types

Authors:
Robert R. Fenichel
Affiliations:
-
Venue:
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Year:
1971

Citing 6
Cited 1

Recovery of reentrant list structures in SLIP

Communications of the ACM
Structure of a LISP system using two-level storage

Communications of the ACM
A LISP garbage-collector for virtual-memory computer systems

Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
Symmetric list processor

Communications of the ACM
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual

Symbolic mathematical computation—introduction and overview

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

List-processing systems have each allowed use of only a single size and configuration of list cell. This paper describes a system which allows use of arbitrarily many different sizes and configurations of list cell, possibly not specified until run time.