Recursive applicative program schemes
Handbook of theoretical computer science (vol. B)
The monadic second-order logic of graphs VII: graphs as relational structures
Theoretical Computer Science - Special issue on logic and applications to computer science
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
Monadic second-order definable graph transductions: a survey
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
The monadic second-order logic of graphs IX: machines and their behaviours
Selected papers of the workshop on Topology and completion in semantics
Languages, automata, and logic
Handbook of formal languages, vol. 3
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Algebraic Semantics
Graph Grammars and Tree Transducers
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Deciding monadic theories of hyperalgebraic trees
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Higher-Order Pushdown Trees Are Easy
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Semantical Evaluations as Monadic Second-Order Compatible Structure Transformations
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Unsafe grammars and panic automata
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Hi-index | 5.25 |
We denote first-order substitutions of finite and infinite terms by function symbols indexed by the sequences of first-order variables to which substitutions are made. We consider the evaluation mapping from infinite terms to infinite terms that evaluates these substitution operations. This mapping may perform infinitely many nested substitutions, so that a term which has the structure of an infinite string can be transformed into one isomorphic to an infinite binary tree. We prove that this mapping is monadic second-order compatible which means that a monadic second-order formula expressing a property of the output term produced by the evaluation mapping can be translated into a monadic second-order formula expressing this property over the input term. This implies that, deciding the monadic second-order theory of the output term reduces to deciding that of the input term. As an application, we obtain another proof that the monadic second-order properties of the algebraic trees, which represent the behaviours of recursive applicative program schemes, are decidable. This proof extends to hyperalgebraic trees. These infinite trees correspond to certain recursive program schemes with functional parameters of arbitrary high type.