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
Communications of the ACM
LISP 1.5 Programmer's Manual
A bibliography on garbage collection and related topics
ACM SIGPLAN Notices
A facility for defining and manipulating generalized data structures
ACM Transactions on Database Systems (TODS)
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
Managing Reentrant Structures Using Reference Counts
ACM Transactions on Programming Languages and Systems (TOPLAS)
The design of a template structure for a generalized data structure definition facility
ICSE '76 Proceedings of the 2nd international conference on Software engineering
The variable cell length listprocessor VARLIST
ACM '74 Proceedings of the 1974 annual conference - Volume 1
A file definition facility for file structures
SIGFIDET '74 Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control
FOL: a language for implementing file organizations for information storage and retrieval systems
SIGPLAN '73 Proceedings of the 1973 meeting on Programming languages and information retrieval
LPL: a generalized list processing language
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
| Hi-index | 48.22 |
List-processing systems have each allowed the use of only a single size and configuration of list cell. In this paper a system is described which allows the use of arbitrarily many different sizes and configurations of list cells, possibly not specified until run time.