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
AbstractWe present techniques to prove termination and innermost termination of term rewriting syste...
. Term rewriting systems play an important role in various areas, e.g. in abstract data type specifi...
First-order applicative term rewriting systems provide a natural framework for modeling higher-order...
We propose two generalizations of innermost rewriting for which we prove that termination of innermo...
We propose two generalizations of innermost rewriting for which we prove that termination of innermo...
We propose two generalizations of innermost rewriting for which we prove that termination of innermo...
We propose two generalizations of innermost rewriting for which we prove that termination of innermo...
We propose two generalizations of innermost rewriting for which we prove that termination of innermo...
We present a new approach for proving termination of rewrite systems by innermost termination. From ...
Rapport interne.We propose a new approach to prove termination of innermost rewriting, based on indu...
A term rewriting system is {\em strongly innermost normalizing } if every innermost derivation of it...
AbstractA term rewriting system is strongly innermost normalizing if every innermost derivation of i...
A term rewriting system is {\em strongly innermost normalizing } if every innermost derivation of it...
Innermost context-sensitive rewriting (CSR) has been proved useful for modeling the computational be...
Innermost context-sensitive rewriting (CSR) has been proved useful for modeling the computational be...
AbstractWe present techniques to prove termination and innermost termination of term rewriting syste...
. Term rewriting systems play an important role in various areas, e.g. in abstract data type specifi...
First-order applicative term rewriting systems provide a natural framework for modeling higher-order...
We propose two generalizations of innermost rewriting for which we prove that termination of innermo...
We propose two generalizations of innermost rewriting for which we prove that termination of innermo...
We propose two generalizations of innermost rewriting for which we prove that termination of innermo...
We propose two generalizations of innermost rewriting for which we prove that termination of innermo...
We propose two generalizations of innermost rewriting for which we prove that termination of innermo...
We present a new approach for proving termination of rewrite systems by innermost termination. From ...
Rapport interne.We propose a new approach to prove termination of innermost rewriting, based on indu...
A term rewriting system is {\em strongly innermost normalizing } if every innermost derivation of it...
AbstractA term rewriting system is strongly innermost normalizing if every innermost derivation of i...
A term rewriting system is {\em strongly innermost normalizing } if every innermost derivation of it...
Innermost context-sensitive rewriting (CSR) has been proved useful for modeling the computational be...
Innermost context-sensitive rewriting (CSR) has been proved useful for modeling the computational be...
AbstractWe present techniques to prove termination and innermost termination of term rewriting syste...
. Term rewriting systems play an important role in various areas, e.g. in abstract data type specifi...
First-order applicative term rewriting systems provide a natural framework for modeling higher-order...
DOI
Add to ORKG