Symmetric list processor

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Symmetric list processor

Full text

Pdf (1.94 MB)

Source

Communications of the ACM archive
Volume 6 , Issue 9 (September 1963) table of contents

Pages: 524 - 536

Year of Publication: 1963

ISSN:0001-0782

Author

J. Weizenbaum

General Electric Co., Sunnyvale, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 15, Citation Count: 80

Additional Information:

abstract references cited by collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/367593.367617 What is a DOI?

ABSTRACT

A list processing system in which each list cell contains both a forward and a backward link as well as a datum is described. This system is intended for imbedding in higher level languages capable of calling functions and subroutines coded in machine language. The presentation is in the form of FORTRAN programs depending on only a limited set of “primitive” machine language subroutines which are also defined. Finally, a set of field, particularly character, manipulation primitives are given to round out the system.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	H. Gelernter , J. R. Hansen , C. L. Gerberich, A Fortran-Compiled List-Processing Language, Journal of the ACM (JACM), v.7 n.2, p.87-101, April 1960 [doi>10.1145/321021.321022]
	2	NEWELL, A., et. al. Information Processing Language V Manual, Sect. I and II. Rand Corp., P1918 (Mar. 1960).
	3	A. J. Perlis , Charles Thornton, Symbol manipulation by threaded lists, Communications of the ACM, v.3 n.4, p.195-204, April 1960 [doi>10.1145/367177.367202]
	4	J. Weizenbaum, Knotted list structures, Communications of the ACM, v.5 n.3, p.161-165, March 1962 [doi>10.1145/366862.366897]

CITED BY 80

	Feng Xian , Witawas Srisa-an , Hong Jiang, Garbage collection: Java application servers' Achilles heel, Science of Computer Programming, v.70 n.2-3, p.89-110, February, 2008
	David S. Wise, Referencing lists by an edge, Communications of the ACM, v.19 n.6, p.338-342, June 1976
	S. Y. Ku , R. J. Adler, Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm, Communications of the ACM, v.12 n.1, p.23-30, Jan. 1969
	Bertram Raphael, Aspects and applications of symbol manpulation, Proceedings of the 1966 21st national conference, p.69-74, January 1966
	William M. Waite , H. Schorr, A note on the formation of free list, Communications of the ACM, v.7 n.8, p.478, Aug. 1964
	Michael B. Feldman, New languages from old: The extension of programming languages by embedding, with a case study, Proceedings of the 2nd international conference on Software engineering, p.237-242, October 13-15, 1976, San Francisco, California, United States
	Michael B. Feldman, Teaching data abstraction to the practicing programmer: A case study, ACM SIGCSE Bulletin, v.12 n.1, p.9-15, February 1980
	David S. Wise , Joshua Walgenbach, Static and dynamic partitioning of pointers as links and threads, ACM SIGPLAN Notices, v.31 n.6, p.42-49, June 15, 1996
	Ole-Johan Dahl , Kristen Nygaard, SIMULA: an ALGOL-based simulation language, Communications of the ACM, v.9 n.9, p.671-678, Sept. 1966
	Billy G. Claybrook, A facility for defining and manipulating generalized data structures, ACM Transactions on Database Systems (TODS), v.2 n.4, p.370-406, Dec. 1977
	Guy L. Steele, Jr., Multiprocessing compactifying garbage collection, Communications of the ACM, v.18 n.9, p.495-508, Sept. 1975
	Robert R. Fenichel, List tracing in systems allowing multiple cell-types, Communications of the ACM, v.14 n.8, p.522-526, Aug. 1971
	George G. Dodd, Elements of Data Management Systems, ACM Computing Surveys (CSUR), v.1 n.2, p.117-133, June 1969
	Joseph Weizenbaum, Recovery of reentrant list structures in SLIP, Communications of the ACM, v.12 n.7, p.370-372, July 1969
	Stuart E. Madnick, String processing techniques, Communications of the ACM, v.10 n.7, p.420-424, July 1967
	David J. Roth , David S. Wise, One-bit counts between unique and sticky, ACM SIGPLAN Notices, v.34 n.3, p.49-56, March 1999
	Robert R. Fenichel, List-tracing in systems allowing multiple cell-types, Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, p.242-247, March 23-25, 1971, Los Angeles, California, United States
	H. Schorr , W. M. Waite, An efficient machine-independent procedure for garbage collection in various list structures, Communications of the ACM, v.10 n.8, p.501-506, Aug. 1967
	Yossi Levanoni , Erez Petrank, An on-the-fly reference counting garbage collector for Java, ACM SIGPLAN Notices, v.36 n.11, p.367-380, 11/01/2001
	W S Barlett , K J Busch , M L Flynn , R L Salmon, SIGHT, a satellite interactive graphic terminal, Proceedings of the 1968 23rd ACM national conference, p.499-509, August 27-29, 1968
	William E. Ball , Robert I. Berns, AUTOMAST: automatic mathematical analysis and symbolic translation, Communications of the ACM, v.9 n.8, p.626-633, Aug. 1966
	Bertram Raphael, The structure of programming languages, Communications of the ACM, v.9 n.2, p.67-71, Feb. 1966
	J. P. Sansonnet , M. Castan , C. Percebois , D. Botella , J. Perez, Direct execution of lisp on a list_directed architecture, ACM SIGARCH Computer Architecture News, v.10 n.2, p.132-139, March 1982
	William L. Ash , Edgar H. Sibley, Tramp: An interpretive associative processor with deductive capabilities, Proceedings of the 1968 23rd ACM national conference, p.143-156, August 27-29, 1968
	Neal Laurance, A compiler language for data structures, Proceedings of the 1968 23rd ACM national conference, p.387-394, August 27-29, 1968
	W. T. Comfort, Multiword list items, Communications of the ACM, v.7 n.6, June 1964
	Saleh E. Abdullahi , Graem A. Ringwood, Garbage collecting the Internet: a survey of distributed garbage collection, ACM Computing Surveys (CSUR), v.30 n.3, p.330-373, Sept. 1998
	Lapidus , Arnold , Goldstein , Max , Greenspan , Samuel, An algebraic manipulator using SLIP, Proceedings of the first ACM symposium on Symbolic and algebraic manipulation, p.1401-1408, January 1966
	Jacques Cohen, Garbage Collection of Linked Data Structures, ACM Computing Surveys (CSUR), v.13 n.3, p.341-367, Sept. 1981
	Lewis T. Reinwald , Richard M. Soland, Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time, Journal of the ACM (JACM), v.13 n.3, p.339-358, July 1966
	Dorothea A. Klip, The variable cell length listprocessor VARLIST, Proceedings of the 1974 annual conference, p.128-132, January 1974
	George E. Forsythe, A university's educational program in computer science, Communications of the ACM, v.10 n.1, p.3-11, Jan. 1967
	N. J. Denil, A language and model for computer-aided design, Proceedings of the 1966 21st national conference, p.527-535, January 1966
	Ned Chapin, A comparison of file organization techniques, Proceedings of the 1969 24th national conference, p.273-283, August 26-28, 1969
	Joseph Weizenbaum, ELIZA — a computer program for the study of natural language communication between man and machine, Communications of the ACM, v.26 n.1, p.23-28, Jan. 1983
	Stuart C. Shapiro, The list set generator: a construct for evaluating set expressions, Communications of the ACM, v.13 n.12, p.741-744, Dec. 1970
	Eugene W. Myers, Efficient applicative data types, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.66-75, January 15-18, 1984, Salt Lake City, Utah, United States
	G. E. Collins, PM, a system for polynomial manipulation, Communications of the ACM, v.9 n.8, p.578-589, Aug. 1966
	G. Salton, Information science in a Ph.D. computer science program, Communications of the ACM, v.12 n.2, p.111-117, Feb. 1969
	Henry G. Baker, Jr., List processing in real time on a serial computer, Communications of the ACM, v.21 n.4, p.280-294, April 1978
	Frederick W. Blackwell, An on-line symbol manipulation system, Proceedings of the 1967 22nd national conference, p.203-209, January 1967, Washington, D.C., United States
	Arthur S. Radford, Letters to the editor: on word combinations, Communications of the ACM, v.6 n.9, p.575, Sept. 1963
	Daniel G. Bobrow, Managing Reentrant Structures Using Reference Counts, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.3, p.269-273, July 1980
	James M. Sakoda, DYSTAL 2: a general purpose extension of FORTRAN, ACM SIGPLAN Notices, v.14 n.1, p.77-90, January 1979
	Terrence W. Pratt , Daniel P. Friedman, A language extension for graph processing and its formal semantics, Communications of the ACM, v.14 n.7, p.460-467, July 1971
	Walter H. Burkhardt, Letters to the editor: syntax and generalization of ALGOL 60, Communications of the ACM, v.8 n.5, p.261, May 1965
	Guy Lewis Steele, Jr. , Gerald Jay Sussman, The dream of a lifetime: A lazy variable extent mechanism, Proceedings of the 1980 ACM conference on LISP and functional programming, p.163-172, August 25-27, 1980, Stanford University, California, United States
	Daniel G. Bobrow , Bertram Raphael, A comparison of list-processing computer languages: including a detailed comparison of COMIT, IPL-V, LISP 1.5, and SLIP, Communications of the ACM, v.7 n.4, p.231-240, April 1964
	Arnold Lapidus , Max Goldstein, Some experiments in algebraic manipulation by computer, Communications of the ACM, v.8 n.8, p.501-508, Aug. 1965
	Joseph Weizenbaum, ELIZA—a computer program for the study of natural language communication between man and machine, Communications of the ACM, v.9 n.1, p.36-45, Jan. 1966
	Billy G. Claybrook, FOL: a language for implementing file organizations for information storage and retrieval systems, ACM SIGIR Forum, v.9 n.3, p.101-112, Winter 1974
	David W. Bray, Dynamic storage routines for Fortran programs, ACM SIGPLAN Notices, v.9 n.9, p.2-13, September 1974
	Hans-J. Boehm, The space cost of lazy reference counting, ACM SIGPLAN Notices, v.39 n.1, p.210-219, January 2004
	Robert T. Duquet, Eliza in SNOBOL4, ACM SIGPLAN Notices, v.5 n.12, December 1970
	David F. Bacon , Perry Cheng , V. T. Rajan, A unified theory of garbage collection, ACM SIGPLAN Notices, v.39 n.10, October 2004
	Billy G. Claybrook, A file definition facility for file structures, Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control, p.1-14, May 01-03, 1974, Ann Arbor, Michigan
	Andries van Dam, Data and storage structures for interactive graphics, ACM SIGPLAN Notices, v.6 n.2, February 1971
	Herbert J. Bernstein, Ludeman's PL/I FORMAC gradient problem as handled by FORTRAN SYMBOLANG, ACM SIGSAM Bulletin
	F. H. Sage , D. V. Smith, The introduction of a paging technique into the symmetric list processor, SLIP, ACM SIGSAM Bulletin
	Yossi Levanoni , Erez Petrank, An on-the-fly reference-counting garbage collector for java, ACM Transactions on Programming Languages and Systems (TOPLAS), v.28 n.1, p.1-69, January 2006
	Daniel M. Berry, Introduction to Oregano, ACM SIGPLAN Notices, v.6 n.2, February 1971
	Donald B. Russell, Letters to the editor: on the implementation of SLIP, Communications of the ACM, v.8 n.5, p.263, May 1965
	J. Harold McBeth, Letters to the editor: on the reference counter method, Communications of the ACM, v.6 n.9, p.575, Sept. 1963
	Feng Xian , Witawas Srisa-an , Hong Jiang, Investigating throughput degradation behavior of Java application servers: a view from inside a virtual machine, Proceedings of the 4th international symposium on Principles and practice of programming in Java, August 30-September 01, 2006, Mannheim, Germany
	Wei Fu , Carl Hauser, A real-time garbage collection framework for embedded systems, Proceedings of the 2005 workshop on Software and compilers for embedded systems, p.20-26, September 29-October 01, 2005, Dallas, Texas
	Pramod G. Joisha, Compiler optimizations for nondeferred reference: counting garbage collection, Proceedings of the 2006 international symposium on Memory management, June 10-11, 2006, Ottawa, Ontario, Canada
	Lee E. Heindel , Paul W. Purdom, Jr., The automatic optimization of slip routines, ACM SIGSAM Bulletin
	David S. Wise , Brian Heck , Caleb Hess , Willie Hunt , Eric Ost, Research Demonstration of a Hardware Reference-Counting Heap, Lisp and Symbolic Computation, v.10 n.2, p.159-181, July 1997
	Paul Hudak , Adrienne Bloss, The aggregate update problem in functional programming systems, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.300-314, January 14-16, 1985, New Orleans, Louisiana, United States
	Henry G. Baker, Lively linear Lisp: “look ma, no garbage!”, ACM SIGPLAN Notices, v.27 n.8, p.89-98, Aug. 1992
	Nandakumar Sankaran, A bibliography on garbage collection and related topics, ACM SIGPLAN Notices, v.29 n.9, p.149-158, Sept. 1994
	Billy G. Claybrook, LPL: a generalized list processing language, Proceedings of the May 6-10, 1974, national computer conference and exposition, May 06-10, 1974, Chicago, Illinois
	Harel Paz , David F. Bacon , Elliot K. Kolodner , Erez Petrank , V. T. Rajan, An efficient on-the-fly cycle collection, ACM Transactions on Programming Languages and Systems (TOPLAS), v.29 n.4, p.20-es, August 2007
	Pramod G. Joisha, Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast, Proceedings of the 6th international symposium on Memory management, October 21-22, 2007, Montreal, Quebec, Canada
	J. M. Keller , E. C. Strum , G. H. Yang, Remote computing--an experimental system: part 2: internal design, Proceedings of the April 21-23, 1964, spring joint computer conference, April 21-23, 1964, Washington, D.C.
	George G. Dodd, APL: a language for associative data handling in PL/I, Proceedings of the November 7-10, 1966, fall joint computer conference, November 07-10, 1966, San Francisco, California
	Victor Schneider, Some syntactic methods for specifying extendible programming languages, Proceedings of the November 18-20, 1969, fall joint computer conference, November 18-20, 1969, Las Vegas, Nevada
	Victor B. Schneider, A translation grammar for ALGOL 68, Proceedings of the May 5-7, 1970, spring joint computer conference, May 05-07, 1970, Atlantic City, New Jersey
	Kenneth R. Laughery , Allen L. Pinkus, Explorations with a simulation model of short-term memory, Proceedings of the 1st international joint conference on Artificial intelligence, p.691-702, May 07-09, 1969, Washington, DC
	Nicholas V. Findler , Wiley R. McKinzie, On a new tool in artificial intelligence research: an associate memory, parallel processing language, AMPPL-II, Proceedings of the 1st international joint conference on Artificial intelligence, p.259-270, May 07-09, 1969, Washington, DC

Collaborative Colleagues:

J. Weizenbaum: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player