On the Church-Rosser property for the direct sum of term rewriting systems
Journal of the ACM (JACM)
Counterexamples to termination for the direct sum of term rewriting systems
Information Processing Letters
Rewrite, rewrite, rewrite, rewrite, rewrite...
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modular term rewriting systems and the termination
Information Processing Letters
Rewrite, rewrite, rewrite, rewrite, rewrite, …
Selected papers of the 16th international colloquium on Automata, languages, and programming
Handbook of theoretical computer science (vol. B)
Handbook of logic in computer science (vol. 2)
Modularity of confluence: a simplified proof
Information Processing Letters
Modular properties of conditional term rewriting systems
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Transfinite reductions in orthogonal term rewriting systems
Information and Computation
Modular termination of r-consistent and left-linear term rewriting systems
Theoretical Computer Science
Modular properties of composable term rewriting systems
Journal of Symbolic Computation
On the modularity of normal forms in rewriting
Journal of Symbolic Computation
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Term rewriting and all that
Infinite &lgr;-calculus and types
Theoretical Computer Science - Special issue: Gentzen
Advanced topics in term rewriting
Advanced topics in term rewriting
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
Weak Orthogonality Implies Confluence: The Higher Order Case
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Modular Aspects of Properties of Term Rewriting Systems Related to Normal Forms
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
On confluence and residuals in Cauchy convergent transfinite rewriting
Information Processing Letters
Modularity of Convergence in Infinitary Rewriting
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Infinitary Combinatory Reduction Systems
Information and Computation
Modularity in term rewriting revisited
Theoretical Computer Science
Hi-index | 0.00 |
We study modular properties in strongly convergent infinitary term rewriting. In particular, we show that:*Confluence is not preserved across direct sum of a finite number of systems, even when these are non-collapsing. *Confluence modulo equality of hypercollapsing subterms is not preserved across direct sum of a finite number of systems. *Normalization is not preserved across direct sum of an infinite number of left-linear systems. *Unique normalization with respect to reduction is not preserved across direct sum of a finite number of left-linear systems. Together, these facts constitute a radical departure from the situation in finitary term rewriting. Positive results are:*Confluence is preserved under the direct sum of an infinite number of left-linear systems iff at most one system contains a collapsing rule. *Confluence is preserved under the direct sum of a finite number of non-collapsing systems if only terms of finite rank are considered. *Top-termination is preserved under the direct sum of a finite number of left-linear systems. *Normalization is preserved under the direct sum of a finite number of left-linear systems. All of the negative results above hold in the setting of weakly convergent rewriting as well, as do the positive results concerning modularity of top-termination and normalization for left-linear systems.