The evaluation of first-order substitution is monadic second-order compatible

Theoretical Computer Science

Volumn 281, Issue 1-2, 2002, Pages 177-206

  Courcelle, Bruno ^a   Knapik, Teodor ^b  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b UNIVERSITÉ DE LA RÉUNION   (France)

Author keywords

Algebraic tree; Decidability of logical theories; First order substitution; Hyperalgebraic tree; Monadic second order logic

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING; DECISION THEORY; RECURSIVE FUNCTIONS; SEMANTICS;

ALGEBRAIC TREES;

TREES (MATHEMATICS);

EID: 0037014257     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00012-9     Document Type: Article

References (21)

1. Paths in the lambda-calculus
2. The optimal implementation of functional programming languages
3. Fundamental properties of infinite trees
4. Equivalence and transformations of regular systems - Applications to recursive program schemes and grammars
5. Recursive applicative program schemes
6. The monadic second-order logic of graphs, VII: Graphs as relational structures
7. Monadic second-order definable graph transductions: A survey
8. The monadic second-order theory of graphs IX: Machines and their behaviours
9. The expression of graph properties and graph transformations in monadic second-order logic
10. Handle-rewriting hypergraph grammars
11. Algebraic families of interpretations
12. The algebraic semantics of recursive program schemes
13. Upper bounds to clique width of graphs
14. Monadic second-order logic, graph coverings and unfoldings of transition systems
15. The IO- and OI-hierarchies
16. Graph grammars and tree transducers
17. Program transformations and algebraic semantics
18. Algebraic semantics
19. Deciding monadic theories of hyperalgebraic trees
20. Decidability of second-order theories and automata on infinite trees
21. Languages, automata and logic