Recursion schemes with lists

Authors:
James H. Morris, Jr.
Affiliations:
-
Venue:
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Year:
1972

Citing 1
Cited 2

Translating recursion equations into flow charts

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing

Effective proper procedures and universal classes of program schemata

Journal of Computer and System Sciences
Recent developments in the theory of data structures

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheme translation is used to compare the abilities of languages obtained by augmenting recursion schemes with lists, markers, and functional values. It is shown that the first two additions make orthogonal contributions to the language's power. Theorems 4 and 5 appear to be new results.