Book ChapterDOI
Higher type program schemes and their tree languages
Reads0
Chats0
TLDR
This work introduces classes of program schemes, which generalize the notion of a recursive program scheme in the sense of Nivat, by allowing recursion on higher functional types and proves that the concept of schematic tree grammars is extended and allows to generate new tree languages.About:
This article is published in Theoretical Computer Science.The article was published on 1977-03-28. It has received 27 citations till now. The article focuses on the topics: Tree (data structure) & Recursive data type.read more
Citations
More filters
Journal ArticleDOI
The IO- and OI-hierarchies
TL;DR: It is proved, that differentiating according to the functional level of recursion leads to two infinite hierarchies of recursive languages, the IO - and OI-hierarchies, which can be characterized as canonical extensions of the regular, context-free, and IO-and-macro languages, respectively.
Journal ArticleDOI
IO and OI. II
TL;DR: Several “Mezei-and-Wright-like” results are obtained which relate the context-free tree languages to recognizable tree languages and to nondeterministic recursive program(scheme)s (called by value and called by name).
Journal ArticleDOI
Collapsible Pushdown Automata and Recursion Schemes
TL;DR: It is shown that the problem of solving parity games over the configuration graphs of order-n CPDA is n-EXPTIME complete, subsuming several well-known results about the solvability of games over higher-order pushdown graphs by (respectively) Walukiewicz, Cachat, and Knapik et al.
Proceedings ArticleDOI
Higher-Order Model Checking: An Overview
TL;DR: This paper aims to give an overview of recent developments in higher-order model checking.
Journal ArticleDOI
Continuous additive algebras and injective simulations of synchronization trees
TL;DR: It is shown that the inequational laws of the sum operation in conjunction with the least fixed point operation in continuous additive algebras have a finite axiomatization over the inequati ons of ordered iteration alg ebras.
References
More filters
Journal ArticleDOI
Algebraic automata and context-free sets
Jorge E. Mezei,Jesse B. Wright +1 more
TL;DR: A principal objective of the paper is to establish in the context of abstract algebra, relationships between such concepts as equational and recognizable sets.
Proceedings ArticleDOI
Initial algebra semantics
TL;DR: An overview of the concept of initial algebra semantics is provided and several apparently divergent approaches to specifying formal semantics for programming languages are applications ofInitial algebra semantics.
On the interpretation of recursive program schemes
TL;DR: A semantics for monadic recursive program schemes as rewriting systems which generate subsets of a free magma and defining a mapping of such subsets in a proper domain of functions is described.