LISP 1.5 Programmer's Manual
An efficient procedure for the generation of closed subsets
Communications of the ACM
An efficient machine-independent procedure for garbage collection in various list structures
Communications of the ACM
A table driven complier for use with automatic test equipment
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
| Hi-index | 0.03 |
Computers have long been in general use for solving numerical problems and pioneering interest has now switched to their use for non-numerical work, that is, for manipulating symbols. Examples are compiling, studies in artificial intelligence, layout problems, etc. List-processing was a breakthrough in symbol manipulation since it provided a flexible way of organizing the computer memory. The paper explains in a tutorial manner what goes on in the computer memory when list-processing operations are performed, and takes as an example the formal differentiation of an algebraic expression written in Polish notation.