Computer Languages for Symbol Manipulation
IRE Transactions on Electronic ComputersPublished 1 December 1961
Bert F. Green
Citations11
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
These particular languages have been used to write game-playing, problem-solving, and other ``intelligent'' Programs.
Abstract
Complex, flexible, computer programs can be written easily in list-processing languages. Storage registers are linked together in arbitrary sequences to form lists and list structures, which are the units of the languages. Special provisions are made for recursive subroutines and for hierarchical programs. These particular languages have been used to write game-playing, problem-solving, and other ``intelligent'' Programs.
Keywords
Computer Science
Communications of the ACMRecursive functions of symbolic expressions and their computation by machine, Part I
1,351 Citations1960John McCarthy
A programming system called LISP (for LISt Processor) developed for the IBM 704 computer by the Artificial Intelligence group at M.I.T. was designed to facilitate experiments with a proposed system called the Advice Taker, whereby a machine could be instructed to handle declarative as well as imperative sentences and could exhibit "common sense" in carrying out its instructions.
Communications of the ACMTrie memory
1,081 Citations1960Edward Fredkin
In this paper several paradigms of trie memory are described and compared with other memory paradigm, their advantages and disadvantages are examined in detail, and applications are discussed.
Programs with common sense
805 Citations1960John McCarthy
This paper discusses programs to manipulate in a suitable formal language (most likely a part of the predicate calculus) common instrumental statements, where the basic program will draw immediate conclusions from a list of premises.
IEEE Transactions on Information TheoryThe logic theory machine--A complex information processing system
776 Citations1956Allen Newell, Herbert A. Simon
A complex information processing system that is capable of discovering proofs for theorems in symbolic logic, written in a formal language, of the nature of a pseudo-code, suitable for coding for digital computers is described.
IBM Journal of Research and DevelopmentChess-Playing Programs and the Problem of Complexity
315 Citations1958Allen Newell, James Shaw +1 more
The Los Alamos program is an almost perfect example of the type of system specified by Shannon, and the static evaluation function consisted of a sum of material and mobility measures.
Management ScienceSummary of a Heuristic Line Balancing Procedure
102 Citations1960Fred M. Tonge
This research was undertaken to investigate the application of complex information processing techniques (as used in producing the Chess Machine and Logic Theorist) to a typical industrial problem.
Empirical explorations of the geometry theorem machine
71 Citations1960H. Gelernter, Josie Hansen +1 more
Communications of the ACMSymbol manipulation by threaded lists
68 Citations1960Alan J. Perlis, Charles A. Thornton
Lisp is that the extraction of subexpressions is a fairly involved, rather than an elementary, operation, and if the functionsre to be represented by computer routines, Lisp is essen:ally faster.
Journal of the ACMA Fortran-Compiled List-Processing Language
61 Citations1960H. Gelernter, Josie Hansen +1 more
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.
Communications of the ACMAn introduction to information processing language V
48 Citations1960Allen Newell, Fred M. Tonge
This paper is an informal introduction to Language V (IPL-V), a symbol and list-struc language present ly implemented on the IBM and contains a discussion of the hmguage, a series of Information Processes developed and of the basic concepts in [PL-V.
Communications of the ACMRecursive subscripting compilers and list-type memories
13 Citations1959John W. Carr
Algebraic translators, like the IT ([ntenm/ Translator) Compiler], which have a reeursive indexing struct, ure, allow deseripti(m of processes for using lisis in a w~ry powerful fashion, but algebraic lallguagcs now in use, Program for Bti:SM 171, do not allow subseripting of sub-scripts and theref(the authors eammt lie used easily with tilt