| 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 |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 34, Citation Count: 23
|
|
|
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
|
A. Newell , J. C. Shaw , H. A. Simon, Empirical explorations of the logic theory machine: a case study in heuristic, Papers presented at the February 26-28, 1957, western joint computer conference: Techniques for reliability, p.218-230, February 26-28, 1957, Los Angeles, California
[doi> 10.1145/1455567.1455605]
|
| |
4
|
1VLINSKY, M. L., Some methods of artificial intelligence and heuristic programming, Proc. Symposium on the Mechanization of Thought Processes, Teddington (1958).
|
 |
5
|
A. Newell , J. C. Shaw, Programming the logic theory machine, Papers presented at the February 26-28, 1957, western joint computer conference: Techniques for reliability, p.230-240, February 26-28, 1957, Los Angeles, California
[doi> 10.1145/1455567.1455606]
|
| |
6
|
WANG, H., Toward mechanical mathematics, IBM J. Res. Dev. ~4, No. 1 (1960).
|
CITED BY 23
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
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.
|
|
|
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
|
|
|
|
|