Study of a Computer for Direct Execution of List Processing Language

摘要

In recent years, list processing languages have been found useful in a variety of non-numerical applications of computers. These languages assume that data is structured in the form of simple or complex lists (i.e. lists of lists, etc.) rather than in simple vector or matrix-like arrays. Current languages also assume that such lists are stored in conventional location-addressable memories. This research demonstrates (a) the utilization of hardware, rather than software, for the interpretation and execution of list languages (b) the employment of a content-addressable or associative memory for the storage of lists and operating instructions or definitions and (c) the design of two list processing languages based entirely on (a) and (b) above. Systems designs of the two machines with only associative memories which directly interpret and execute the two list languages is given. The first language is developed from the basic DLM (i.e. Distributed Logic Memory - an associative memory) commands; the second from an existing language in which all major operations are determined by definitions stored in memory. The design information is presented in the form of Mealy state diagrams. (Author)