Computer Languages for Symbol Manipulation
- 1 December 1961
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-10 (4) , 729-735
- https://doi.org/10.1109/TEC.1961.5219281
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
This publication has 8 references indexed in Scilit:
- Trie memoryCommunications of the ACM, 1960
- Recursive functions of symbolic expressions and their computation by machine, Part ICommunications of the ACM, 1960
- An introduction to information processing language VCommunications of the ACM, 1960
- Symbol manipulation by threaded listsCommunications of the ACM, 1960
- A Fortran-Compiled List-Processing LanguageJournal of the ACM, 1960
- Recursive subscripting compilers and list-type memoriesCommunications of the ACM, 1959
- Chess-Playing Programs and the Problem of ComplexityIBM Journal of Research and Development, 1958
- The logic theory machine--A complex information processing systemIEEE Transactions on Information Theory, 1956