Generalized innermost rewriting

Authors:
Jaco van de Pol;Hans Zantema
Affiliations:
Department of Software Engineering, CWI, Amsterdam, The Netherlands;Department of Computer Science, TU Eindhoven, Eindhoven, The Netherlands
Venue:
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Year:
2005

Citing 8
Cited 2

Counterexamples to termination for the direct sum of term rewriting systems

Information Processing Letters
Term-rewriting systems with rule priorities

Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Term rewriting and all that

Term rewriting and all that
Lazy rewriting on eager machinery

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing in Systems Described by Equations

Computing in Systems Described by Equations
Context-sensitive rewriting strategies

Information and Computation
JITty: A Rewriter with Strategy Annotations

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems

Fundamenta Informaticae

Termination of Priority Rewriting

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Random descent

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose two generalizations of innermost rewriting for which we prove that termination of innermost rewriting is equivalent to termination of generalized innermost rewriting. As a consequence, by rewriting in an arbitrary TRS certain non-innermost steps may be allowed by which the termination behavior and efficiency is often much better, but never worse than by only doing innermost rewriting.