Program Schemes with Pushdown Stores

DOI10.1137/0201017MaRDI QIDQ4404459zbMATH OpenOpenAlexFDO

Authors Steven Brown, David Gries, Thomas G. Szymanski

Publication date 1972

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/5982

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(10)

• Some relationships between logics of programs and complexity theory
• The equivalence of r.e. program schemes and data flow schemes
• Definability by programs in first-order structures
• On the expressive power of finitely typed and universally polymorphic recursive procedures
• Function iteration logics and flowchart schemata
• Effective proper procedures and universal classes of program schemata
• Recursive information transducers: Computation models
• Translatability of schemas over restricted interpretations
• On the structural simplicity of machines and languages
• Necessary and sufficient conditions for the universality of programming formalisms

This page was built for publication: Program Schemes with Pushdown Stores

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