Loop schemata

Authors:
Robert L Constable
Affiliations:
-
Venue:
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Year:
1971

Citing 3
Cited 2

Theory of recursive functions and effective computability

Theory of recursive functions and effective computability
The complexity of loop programs

ACM '67 Proceedings of the 1967 22nd national conference
Computation: finite and infinite machines

Computation: finite and infinite machines

Subrecursive program schemata I & II(I. Undecidable equivalence problems, II. Decidable equivalence problems)

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Subrecursive program schemata I & II: I. Undecidable equivalence problems; II. Decidable equivalence problems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a class of program schemata arising from the subrecursive programming language Loop. In this preliminary report on Loop schemata we show how to assign functional expressions to these schemata (as one aspect of the problem of assigning meaning to these programs), and we outline a solution to the schemata equivalence problem. Schemata equivalence is reduced to questions about formal expressions. Certain subcases of the problem are easily shown solvable, and although we claim that the general problem is solvable, we do not present the complete solution here because of its complexity.