UPDF AI

Recursion Schemes and Generalized Interpretations (Extended Abstract)

J. Gallier

1979 · DOI: 10.1007/3-540-09510-1_20
International Colloquium on Automata, Languages and Programming · 6 Citations

TLDR

This paper investigates some of the underlying axioms allowing the fixpoint-semantics approach to hold for tree-like recursion schemes and shows that in order to provide the semantics of arbitrary finite recursions schemes, rational algebraic theories are insufficient and it is necessary to introduce a new class of "recursion-closed" algebraic theory.