 Random-Access Stored-Program Machines, an Approach to Programming LanguagesCalvin C. Elgot and
Abraham Robinson
A chapter in Selected Papers, 1982, pp 17-51 from Springer Abstract: 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 programming languages with semantics. The notion of Random-Access Stored-Program Machine (RASP) is intended to capture some of the most salient features of the central processing 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 instructions 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 computers. The relation between problem-oriented languages (POL) and machine languages (ML) is briefly considered. Keywords: Data Location; Instruction Schema; Recursive Function; Finite Sequence; Sequential Function (search for similar items in EconPapers) There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-8177-8_2 Ordering information: This item can be ordered from DOI: 10.1007/978-1-4613-8177-8_2 Access Statistics for this chapter More chapters in Springer Books from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.