On Classes of Program Schemata
From MaRDI portal
Publication:5660503
DOI10.1137/0201006zbMath0247.68031OpenAlexW2078079279MaRDI QIDQ5660503
David Gries, Robert L. Constable
Publication date: 1972
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0201006
Related Items
Some relationships between logics of programs and complexity theory ⋮ Computability by nondeterministic program and the Moschovakis search computability ⋮ On the structural simplicity of machines and languages ⋮ Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I ⋮ The equivalence of r.e. program schemes and data flow schemes ⋮ Program Schemes with Deep Pushdown Storage ⋮ Definability by programs in first-order structures ⋮ On the expressive power of finitely typed and universally polymorphic recursive procedures ⋮ Program equivalence and context-free grammars ⋮ Function iteration logics and flowchart schemata ⋮ Computability concepts for programming language semantics ⋮ Effective proper procedures and universal classes of program schemata ⋮ Recursive converters on a memory ⋮ Church-Rosser converters ⋮ Expressive power of typed and type-free programming languages ⋮ On the power of deep pushdown stacks ⋮ Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems ⋮ Some equivalent transformations of recursive programs based on their schematic properties ⋮ Necessary and sufficient conditions for the universality of programming formalisms ⋮ Program schemes, arrays, Lindström quantifiers and zero-one laws ⋮ Logical and schematic characterization of complexity classes
