A syntax directed compiler for ALGOL 60
Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
Report on the algorithmic language ALGOL 60
Communications of the ACM
Artificial intelligence and self-organizing systems: An experimental model of adaptive memory
ACM '62 Proceedings of the 1962 ACM national conference on Digest of technical papers
Hi-index | 0.00 |
IN RECENT YEARS, there has been a flourish of programs which discuss and manipulate list-like structures, either standing by themselves or embedded in larger systems; for example—LISP, IPL, Knotted Lists, Threaded Lists, FORTRAN LIST PROCESSOR, XTRAN list system. On careful inspection it becomes evident that, although the ability of these systems to operate on such structures significantly enhances the power of programming languages, a severe penalty is levied in terms of execution time. Closer analysis reveals that every implementation of such a system either is directly tied to a particular computer, or else it fails to utilize the idiosyncrasies of the various computers on which it is to be used. The resolution of this problem involves first the development of a notation that is sufficient for describing arbitrary connector systems and arbitrary computers, and then a method of using such descriptions to choose automatically, from among the repertoire of machine operations, sequences of instructions that optimally carry out the intent of operations defined over the connector system.