Classes of equational programs that compile into efficient machine code
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Information and Computation
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
Call by need computations to root-stable form
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term rewriting and all that
Sequentiality, monadic second-order logic and tree automata
Information and Computation
Advanced topics in term rewriting
Advanced topics in term rewriting
Computing in Systems Described by Equations
Computing in Systems Described by Equations
Proofs and Reachablity Problem for Ground Rewrite Systems
Proceedings of the 6th International Meeting of Young Computer Scientists on Aspects and Prospects of Theoretical Computer Science
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Autowrite: A Tool for Checking Properties of Term Rewriting Systems
RTA '02 Proceedings of the 13th 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
Decidability of confluence for ground term rewriting systems
FCT '85 Fundamentals of Computation Theory
Approximating Dependency Graphs Using Tree Automata Techniques
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Decidable Call by Need Computations in term Rewriting (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Strong Sequentiality of Left-Linear Overlapping Rewrite Systems
CTRS '94 Proceedings of the 4th International Workshop on Conditional and Typed Rewriting Systems
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
| Hi-index | 0.00 |
The theorem of Huet and Lévy stating that for orthogonal rewrite systems (i) every reducible term contains a needed redex and (ii) repeated contraction of needed redexes results in a normal form if the term under consideration has a normal form, forms the basis of all results on optimal normalizing strategies for orthogonal rewrite systems. However, needed redexes are not computable in general. In the paper we show how the use of approximations and elementary tree automata techniques allows one to obtain decidable conditions in a simple and elegant way. Surprisingly, by avoiding complicated concepts like index and sequentiality we are able to cover much larger classes of rewrite systems. We also study modularity aspects of the classes in our hierarchy. It turns out that none of the classes 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.