Subrecursive Programming Languages, Part I

DOI10.1145/321707.321721MaRDI QIDQ5674992zbMATH OpenOpenAlexFDO

Authors Allan Borodin, Robert Constable

Publication date 1972

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321707.321721

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cited in

(13)

• Indexings of subrecursive classes
• The independence of control structures in abstract programming systems
• Some simplified undecidable and NP-hard problems for simple programs
• The logical meaning of programs of a subrecursive language
• Polynomial and abstract subrecursive classes
• Predecessor machines
• Elementary functions and loop programs
• Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems
• A note on the complexity of program evaluation
• Safe programming
• A survey of state vectors
• A local termination property for term rewriting systems
• Read/write factorizable programs

This page was built for publication: Subrecursive Programming Languages, Part I

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