Empirical explorations of the logic theory machine: a case study in heuristic
IRE-AIEE-ACM '57 (Western) Papers presented at the February 26-28, 1957, western joint computer conference: Techniques for reliability
Programming the logic theory machine
IRE-AIEE-ACM '57 (Western) Papers presented at the February 26-28, 1957, western joint computer conference: Techniques for reliability
Conception, evolution, and application of functional programming languages
ACM Computing Surveys (CSUR)
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
An efficient machine-independent procedure for garbage collection in various list structures
Communications of the ACM
An extension to ALGOL for manipulating formulae
Communications of the ACM
A note on the formation of free list
Communications of the ACM
Low-level language subroutines for use within Fortran
Communications of the ACM
A method for overlapping and erasure of lists
Communications of the ACM
Communications of the ACM
Input data organization in FORTRAN
Communications of the ACM
Communications of the ACM
Direct execution of lisp on a list_directed architecture
ASPLOS I Proceedings of the first international symposium on Architectural support for programming languages and operating systems
Early LISP history (1956 - 1959)
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
ACM SIGPLAN Notices - Special issue: History of programming languages conference
Compiler optimizations for nondeferred reference: counting garbage collection
Proceedings of the 5th international symposium on Memory management
History of programming languages I
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast
Proceedings of the 6th international symposium on Memory management
A principled approach to nondeferred reference-counting garbage collection
Proceedings of the fourth ACM SIGPLAN/SIGOPS international conference on Virtual execution environments
ACM Lisp Bulletin
Empirical explorations of the geometry theorem machine
IRE-AIEE-ACM '60 (Western) Papers presented at the May 3-5, 1960, western joint IRE-AIEE-ACM computer conference
Remote computing--an experimental system: part 2: internal design
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
Incorporating complex data structures into a language for social science research
AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference
Procedural representation of three-dimensional objects
IBM Journal of Research and Development
The history of language processor technology in IBM
IBM Journal of Research and Development
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
Data Linkage Dynamics with Shedding
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
| Hi-index | 0.15 |
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.