Random-Access Stored-Program Machines, an Approach to Programming Languages
From MaRDI portal
Publication:5586344
DOI10.1145/321239.321240zbMath0192.07302OpenAlexW2065953381MaRDI QIDQ5586344
Calvin C. Elgot, Abraham Robinson
Publication date: 1964
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321239.321240
Related Items
The origins of structural operational semantics ⋮ Semantics of context-free languages ⋮ Computational complexity of random access stored program machines ⋮ Programs=data=first-class citizens in a computational world ⋮ From Turing machines to computer viruses ⋮ On the definition of the variables used and set by a computation ⋮ The validity of return address schemes ⋮ Predecessor machines ⋮ In memoriam Calvin C. Elgot ⋮ Modeling of storage properties of higher-level languages ⋮ A survey of state vectors ⋮ Abraham Robinson, 1918-1974 ⋮ Nonexistence of program optimizers in several abstract settings ⋮ On the formal definition of dependencies between the control and information structure of a data space ⋮ Data spaces with indirect addressing ⋮ Towards a theory of semantics and compilers for programming languages ⋮ Subrecursive programming languages. II. On program size ⋮ Sequential and jumping machines and their relation to computers ⋮ Semantics of Mizar as an Isabelle object logic ⋮ Berechnung und Programm. II ⋮ Calvin C. Elgot (1922-1980) ⋮ Theory of formal grammars ⋮ Remarks on Testing Probabilistic Processes
