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

DOI10.1145/321239.321240MaRDI QIDQ5586344zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

languages, automata, networks

Cited in

(24)

• On the formal definition of dependencies between the control and information structure of a data space
• Theory of formal grammars
• The origins of structural operational semantics
• Towards a theory of semantics and compilers for programming languages
• Nonexistence of program optimizers in several abstract settings
• From Turing machines to computer viruses
• Theoretical computer science: computability, decidability and logic
• Semantics of context-free languages
• Programs=data=first-class citizens in a computational world
• A survey of state vectors
• Berechnung und Programm. II
• In memoriam Calvin C. Elgot
• Computational complexity of random access stored program machines
• Remarks on testing probabilistic processes
• Abraham Robinson, 1918-1974
• The validity of return address schemes
• Data spaces with indirect addressing
• Calvin C. Elgot (1922-1980)
• Modeling of storage properties of higher-level languages
• Semantics of Mizar as an Isabelle object logic
• Predecessor machines
• Subrecursive programming languages. II. On program size
• On the definition of the variables used and set by a computation
• Sequential and jumping machines and their relation to computers

This page was built for publication: Random-Access Stored-Program Machines, an Approach to Programming Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5586344)