Paper Information - Computer Languages for Symbol Manipulation

Computer Languages for Symbol Manipulation

Complex, flexible, computer programs can be written easily in list-processing languages. Storage registers are linked together in arbitary 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.

Bert F. Green

[1] John McCarthy,et al. Recursive functions of symbolic expressions and their computation by machine, Part I , 1959, Commun. ACM.

[2] Fred M. Tonge,et al. Summary of a Heuristic Line Balancing Procedure , 1960 .

[3] Alan J. Perlis,et al. Symbol manipulation by threaded lists , 1960, CACM.

[4] Victor H. Yngve. A programming language for mechanical translation , 1958, Mech. Transl. Comput. Linguistics.

[5] Allen Newell,et al. The logic theory machine-A complex information processing system , 1956, IRE Trans. Inf. Theory.

[6] Allen Newell,et al. An introduction to information processing language V , 1960, Commun. ACM.

[7] Allen Newell,et al. Chess-Playing Programs and the Problem of Complexity , 1958, IBM J. Res. Dev..

[8] John W. Carr. Recursive subscripting compilers and list-type memories , 1959, CACM.

[9] Edward Fredkin,et al. Trie memory , 1960, CACM.

[10] John McCarthy,et al. Programs with common sense , 1960 .

[11] H. Gelernter,et al. A Fortran-Compiled List-Processing Language , 1960, JACM.

[12] D. Loveland,et al. Empirical explorations of the geometry theorem machine , 1960, IRE-AIEE-ACM '60 (Western).