Handbook of theoretical computer science (vol. B)
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Theoretical Computer Science - Selected papers of the Second International Conference on algebraic and logic programming, Nancy, France, October 1–3, 1990
Term rewriting and all that
Computing in Systems Described by Equations
Computing in Systems Described by Equations
Perpetuality and Strong Normalization in Orthogonal Term Rewriting Systems
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Complexity Classes and Rewrite Systems with Polynomial Interpretation
Proceedings of the 12th International Workshop on Computer Science Logic
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
| Hi-index | 0.00 |
Let F be a signature and R a term rewrite system on ground terms of F. We define the concepts of a context-free potential redex in a term and of bounded confluent terms. We bound recursively the lengths of derivations of a bounded confluent term t by a function of the length of derivations of context-free potential redexes of this term. We define the concept of inner redexand we apply the recursive bounds that we obtained to prove that, whenever R is a confluent overlay term rewrite system, the derivational length bound for arbitrary terms is an iteration of the derivational length bound for inner redexes.