Random-Access Stored-Program Machines, an Approach to Programming Languages

Publisher Website
Google Scholar
Abstract
A new class of machine models as a framework for the rational discussion of programming languages is introduced. In particular, a basis is provided for endowing pro- gramming languages with semantics. The notion of Random-Access Stored-Program Ma- chine (RASP) is intended to capture some of the most salient features of the central process- ing unit of a modern digital computer. An instruction of such a machine is understood as a mapping from states (of the machine) into states. Some classification of instructions is introduced. It is pointed out in several theorems that programs of finitely determined in- structions are properly more powerful if address modification is permitted than when it is forbidden, thereby shedding some light on the role of address modification in digital com- puters. The relation between problem-oriented languages (POL) and machine languages (ML) is briefly considered.

This publication has 5 references indexed in Scilit: