Handbook of theoretical computer science (vol. B)
Sequentiality in orthogonal term rewriting systems
Journal of Symbolic Computation
NV-sequentiality: a decidable condition for call-by-need computations in term-rewriting systems
SIAM Journal on Computing
Handbook of logic in computer science (vol. 2)
The functional strategy and transitive term rewriting systems
Term graph rewriting
Bounded, strongly sequential and forward-branching term rewriting systems
Journal of Symbolic Computation
Comparing curried and uncurried rewriting
Journal of Symbolic Computation
Term rewriting and all that
Sequentiality, monadic second-order logic and tree automata
Information and Computation
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Classes of Equational Programs that Compile into Efficient Machine Code
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Decidable Approximations of Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Decidable Call by Need Computations in term Rewriting (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Autowrite: A Tool for Checking Properties of Term Rewriting Systems
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Modularity in term rewriting revisited
Theoretical Computer Science
| Hi-index | 0.00 |
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple decidability proofs for a hierarchy of classes of rewrite systems that are much larger than earlier classes defined using the complicated sequentiality concept. In this paper we study the modularity of membership in the new hierarchy. Surprisingly, it turns out that none of the classes in the hierarchy is preserved under signature extension. By imposing various conditions we recover the preservation under signature extension. By imposing some more conditions we are able to strengthen the signature extension results to modularity for disjoint and constructor-sharing combinations.