article

Free access

List tracing in systems allowing multiple cell-types

Author:

Robert R. FenichelAuthors Info & Claims

Communications of the ACM, Volume 14, Issue 8

Pages 522 - 526

https://doi.org/10.1145/362637.362646

Published: 01 August 1971 Publication History

PDF eReader

Abstract

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.

References

[1]

Abrahams, Paul W., et al. The LISa 2 programming language and system. Proc. AHeS 1966 FJCC, VOI. 29, Spartan Books, N.Y., pp. 661-676.

Google Scholar

[2]

Anonymous. PL/I reference manual, IBM Corp., 1968.

Google Scholar

[3]

Bobrow, Daniel G., and Murphy, Daniel L. Structure of a LISP system using two-level storage. Comm. ACM 10, 3 (Mar. 1967), 155-159.

Digital Library

Google Scholar

[4]

Fenichel, Robert R., and Yochelson, Jerome C. A LISP garbagecollector for virtual-memory computer systems. Comm. ACM 12, 11 (Nov. 1969), 611-612.

Digital Library

Google Scholar

[5]

Hawkinson, L. LISP 2 internal storage conventions. Tech. Memo. TM-3417/550/00, System Development Corp., Santa Monica, Calif., 1967.

Google Scholar

[6]

Knuth, Donald E. Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1968.

Google Scholar

[7]

Lang, Charles A. SAL--Systems assembly language. Proc. AFIPS 1969 SJCC, Vol. 34, AFlPS Press, Montvale, N.J., pp. 543-555.

Google Scholar

[8]

Marshall, S. An Algol 68 garbage collector. Tech. Memo. TM011, Kiewit Computation Center, Dartmouth College, Hanover, N.H., 1969.

Google Scholar

[9]

McCarthy, John. Recursive functions of symbolic expressions and their computation by machine, Pt. I. Comm. ACM 3, 4 (Apr. 1960), 184-195.

Digital Library

Google Scholar

[10]

McCarthy, John, et al. LiSP 1.5 programmer's manual. MIT Press, Cambridge, Mass., 1965.

Digital Library

Google Scholar

[11]

Ross, D.T. AED-0 programming manual. Hectographed, 1964.

Google Scholar

[12]

Weizenbaum, J. Symmetric list processor. Comm. ACM 6, 9 (Sept. 1963), 524-544.

Digital Library

Google Scholar

[13]

Weizenbaum, J. Recovery of reentrant list structures in SLIP. Comm. ACM 12, 7 (July 1969), 370-372.

Digital Library

Google Scholar

Cited By

View all

Sankaran N(1994)A bibliography on garbage collection and related topicsACM SIGPLAN Notices10.1145/185009.18504029:9(149-158)Online publication date: 1-Sep-1994
https://dl.acm.org/doi/10.1145/185009.185040
Cohen J(1981)Garbage Collection of Linked Data StructuresACM Computing Surveys10.1145/356850.35685413:3(341-367)Online publication date: 1-Sep-1981
https://dl.acm.org/doi/10.1145/356850.356854
Bobrow D(1980)Managing Reentrant Structures Using Reference CountsACM Transactions on Programming Languages and Systems10.1145/357103.3571042:3(269-273)Online publication date: 1-Jul-1980
https://dl.acm.org/doi/10.1145/357103.357104
Show More Cited By

List tracing in systems allowing multiple cell-types
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages

Recommendations

List-tracing in systems allowing multiple cell-types
SYMSAC '71: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation

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 ...
Definitional Interpreters for Higher-Order Programming Languages

Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...
Clisp: Conversational Lisp

Clisp is an attempt to make Lisp programs easier to read and write by extending the syntax of Lisp to include infix operators, IF-THEN statements, FOR-DO-WHILE statements, and similar Algol-like constructs, without changing the structure or ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 14, Issue 8

Aug. 1971

56 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/362637

Editor:
M. Stuart Lynn
IBM Scientific Center, Houston, TX

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1971

Published in CACM Volume 14, Issue 8

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
264
Total Downloads

Downloads (Last 12 months)54
Downloads (Last 6 weeks)2

Reflects downloads up to 13 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sankaran N(1994)A bibliography on garbage collection and related topicsACM SIGPLAN Notices10.1145/185009.18504029:9(149-158)Online publication date: 1-Sep-1994
https://dl.acm.org/doi/10.1145/185009.185040
Cohen J(1981)Garbage Collection of Linked Data StructuresACM Computing Surveys10.1145/356850.35685413:3(341-367)Online publication date: 1-Sep-1981
https://dl.acm.org/doi/10.1145/356850.356854
Bobrow D(1980)Managing Reentrant Structures Using Reference CountsACM Transactions on Programming Languages and Systems10.1145/357103.3571042:3(269-273)Online publication date: 1-Jul-1980
https://dl.acm.org/doi/10.1145/357103.357104
Claybrook B(1977)A facility for defining and manipulating generalized data structuresACM Transactions on Database Systems10.1145/320576.3205912:4(370-406)Online publication date: 1-Dec-1977
https://dl.acm.org/doi/10.1145/320576.320591
Claybrook BYeh RRamamoorthy C(1976)The design of a template structure for a generalized data structure definition facilityProceedings of the 2nd international conference on Software engineering10.5555/800253.807713(408-413)Online publication date: 13-Oct-1976
https://dl.acm.org/doi/10.5555/800253.807713
Claybrook BAltshuler GRustin RPlagman B(1974)A file definition facility for file structuresProceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control10.1145/800296.811501(1-14)Online publication date: 1-May-1974
https://dl.acm.org/doi/10.1145/800296.811501
Klip DBrown RGlaze D(1974)The variable cell length listprocessor VARLISTProceedings of the 1974 annual conference - Volume 110.1145/800182.810392(128-132)Online publication date: 1-Jan-1974
https://dl.acm.org/doi/10.1145/800182.810392
Claybrook B(1974)LPLProceedings of the May 6-10, 1974, national computer conference and exposition10.1145/1500175.1500302(659-663)Online publication date: 6-May-1974
https://dl.acm.org/doi/10.1145/1500175.1500302
Claybrook B(1973)FOLACM SIGPLAN Notices10.1145/951787.95177110:1(101-112)Online publication date: 4-Nov-1973
https://dl.acm.org/doi/10.1145/951787.951771
Claybrook BFox MKorfhage R(1973)FOLProceedings of the 1973 meeting on Programming languages and information retrieval10.1145/951762.951771(101-112)Online publication date: 4-Nov-1973
https://dl.acm.org/doi/10.1145/951762.951771
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations