Program schemes, recursion schemes, and formal languages

DOI10.1016/S0022-0000(73)80040-6zbMath0277.68010MaRDI QIDQ1393937

Stephen J. Garland, David C. Luckham

Publication date: 1973

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items

The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes, Unnamed Item, Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales, Langages sur des alphabets infinis, Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism, A survey of state vectors, Unnamed Item, Definability by programs in first-order structures, Unnamed Item, Computability of String Functions Over Algebraic Structures Armin Hemmerling, Simple context-free languages and free monadic recursion schemes, Function iteration logics and flowchart schemata, Toward a mathematical theory of graph-generative systems and its applications, Extended linear macro grammars, iteration grammars, and register programs, Semantics of Higher-Order Recursion Schemes, On a class of recursive procedures and equivalent iterative ones, Monadic recursion schemes: The effect of constants, Decidability of the equivalence problem for deterministic pushdown automata, Translatability of schemas over restricted interpretations, Implementation of data types by algebraic methods, The complexity of monadic recursion schemes: executability problems, nesting depth, and applications, Necessary and sufficient conditions for the universality of programming formalisms, On the Decidability of the Equivalence Problem for Monadic Recursive Programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transductions des langages de Chomsky
• On formalised computer programs
• Computability of Recursive Functions