On Classes of Program Schemata

DOI10.1137/0201006MaRDI QIDQ5660503zbMATH OpenOpenAlexFDO

Authors David Gries, Robert 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(21)

• Effective proper procedures and universal classes of program schemata
• Logical and schematic characterization of complexity classes
• Computability by nondeterministic program and the Moschovakis search computability
• Program Schemes with Deep Pushdown Storage
• The equivalence of r.e. program schemes and data flow schemes
• Recursive converters on a memory
• Computability concepts for programming language semantics
• On the structural simplicity of machines and languages
• On the power of deep pushdown stacks
• Expressive power of typed and type-free programming languages
• Some relationships between logics of programs and complexity theory
• On the expressive power of finitely typed and universally polymorphic recursive procedures
• Program schemes, arrays, Lindström quantifiers and zero-one laws
• Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I
• Some equivalent transformations of recursive programs based on their schematic properties
• Church-Rosser converters
• Necessary and sufficient conditions for the universality of programming formalisms
• Program equivalence and context-free grammars
• Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems
• Definability by programs in first-order structures
• Function iteration logics and flowchart schemata

This page was built for publication: On Classes of Program Schemata

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