A Fortran-Compiled List-Processing Language

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Fortran-Compiled List-Processing Language

Full text

Pdf (1.10 MB)

Source

Journal of the ACM (JACM) archive
Volume 7 , Issue 2 (April 1960) table of contents

Pages: 87 - 101

Year of Publication: 1960

ISSN:0004-5411

Authors

H. Gelernter	International Business Machines Co., Yorktown Heights, N.Y.
J. R. Hansen	International Business Machines Co., Yorktown Heights, N.Y.
C. L. Gerberich	International Business Machines Co., Yorktown Heights, N.Y.

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 28, Citation Count: 23

Additional Information:

abstract references cited by index terms collaborative colleagues peer to peer

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/321021.321022 What is a DOI?

ABSTRACT

A compiled computer language for the manipulation of symbolic expressions organized in storage as Newell-Shaw-Simon lists has been developed as a tool to make more convenient the task of programming the simulation of a geometry theorem-proving machine on the IBM 704 high-speed electronic digital computer. Statements in the language are written in usual Fortran notation, but with a large set of special list-processing functions appended to the standard Fortran library. The algebraic structure of certain statements in this language corresponds closely to the structure of an NSS list, making possible the generation and manipulation of complex list expressions with a single statement. The many programming advantages accruing from the use of Fortran, and in particular, the ease with which massive and complex programs may be revised, combined with the flexibility offered by an NSS list organization of storage make the language particularly useful where, as in the case of our theorem-proving program, intermediate data of unpredictable form, complexity, and length may be generated.

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	GELERNTER, H. AND ROCHESTER, N., Intelligent behavior in problem-solving machines, IBM J. Res. Dev. ~ (1958), 336--345.
	2	GELERNTER, H., Realization of a geometry theorem-proving machine, Proc. Int. Conf. on Information Processing, Unesco, Paris (1959), to be published.
	3	NEWELL, A., SHAW, J. C., AND SIMON, H. A., Empirical explorations of the logic theory machine, Proc. of the Western Joint Computer Conference, (1957), pp. 218-230.
	4	1VLINSKY, M. L., Some methods of artificial intelligence and heuristic programming, Proc. Symposium on the Mechanization of Thought Processes, Teddington (1958).
	5	NEWELL, A., ANn SHAw, J. C., Prograrnrniug the logic theory machine, Proc. of the Western Joint Computer Conference, (1957), pp. 230-240.
	6	WANG, H., Toward mechanical mathematics, IBM J. Res. Dev. ~4, No. 1 (1960).

CITED BY 23

	J. Weizenbaum, Symmetric list processor, Communications of the ACM, v.6 n.9, p.524-536, Sept. 1963
	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
	Lynn D. Yarbrough, Input data organization in FORTRAN, Communications of the ACM, v.5 n.10, p.508-509, Oct. 1962
	A. J. Perlis , Renato Iturriaga, An extension to ALGOL for manipulating formulae, Communications of the ACM, v.7 n.2, p.127-130, Feb. 1964
	M. P. Barnett, Low-level language subroutines for use within Fortran, Communications of the ACM, v.4 n.11, p.492-495, Nov. 1961
	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.
	Herbert Stoyan, Early LISP history (1956 - 1959), Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.299-310, August 06-08, 1984, Austin, Texas, United States
	George E. Collins, A method for overlapping and erasure of lists, Communications of the ACM, v.3 n.12, p.655-657, Dec. 1960
	W. T. Comfort, Multiword list items, Communications of the ACM, v.7 n.6, June 1964
	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
	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
	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
	H. Gelernter , J. R. Hansen , D. W. Loveland, Empirical explorations of the geometry theorem machine, Papers presented at the May 3-5, 1960, western joint IRE-AIEE-ACM computer conference, May 03-05, 1960, San Francisco, California
	Stephen W. Kidd, Incorporating complex data structures into a language for social science research, Proceedings of the November 18-20, 1969, fall joint computer conference, November 18-20, 1969, Las Vegas, Nevada
	Herbert Stoyan, LISP history, ACM Lisp Bulletin
	John McCarthy, History of LISP, History of programming languages I, ACM Press, New York, NY, 1978
	John McCarthy, History of LISP, ACM SIGPLAN Notices, v.13 n.8, p.217-223, August 1978
	Pramod G. Joisha, A principled approach to nondeferred reference-counting garbage collection, Proceedings of the fourth ACM SIGPLAN/SIGOPS international conference on Virtual execution environments, March 05-07, 2008, Seattle, WA, USA
	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
	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
	Henry G. Baker, Minimizing reference count updating with deferred and anchored pointers for functional data structures, ACM SIGPLAN Notices, v.29 n.9, p.38-43, Sept. 1994
	Paul Hudak, Conception, evolution, and application of functional programming languages, ACM Computing Surveys (CSUR), v.21 n.3, p.359-411, Sep. 1989
	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