A Memory Organization for an Elementary List-Processing Computer

This paper presents an elementary computer memory organization capable of direct representation and manipulation of simple linear lists. A conventional random-access memory is used in conjunction with a group of address and word-length registers to store and manipulate single-link list words. Four typical list-processing macroinstructions, INSERT, DELETE, SEARCH, and EXECUTE, are illustrated and a sequence of microsteps for accomplishing each is given.