Two Programming Techniques for One-Plus-One Address Computers
S. Lipton · Journal of the ACM · 1957
TerminologyThe work discussed below was carried out on the Elliott 401 computer.(For a description of this machine, see [1] and [2].)However, these ideas are suitable for any one-plus-one address machine.An instruction for such a computer consists of a group of operation digits (O), the address of the next instruction (I) and a second address (D) which is normally a data address.A denotes the address of the order itself.In a discrimination order, D is taken to be the address of the next order when the test is satisfied.