Subrecursive Programming Languages, Part I
From MaRDI portal
Publication:5674992
DOI10.1145/321707.321721zbMath0259.68036OpenAlexW2134992721MaRDI QIDQ5674992
Allan Borodin, Robert L. 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
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01)
Related Items (13)
A local termination property for term rewriting systems ⋮ Elementary functions and loop programs ⋮ Predecessor machines ⋮ Indexings of subrecursive classes ⋮ Read/write factorizable programs ⋮ The independence of control structures in abstract programming systems ⋮ Some simplified undecidable and NP-hard problems for simple programs ⋮ A survey of state vectors ⋮ A note on the complexity of program evaluation ⋮ The logical meaning of programs of a subrecursive language ⋮ Polynomial and abstract subrecursive classes ⋮ Safe programming ⋮ Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems
This page was built for publication: Subrecursive Programming Languages, Part I
