423 search results - page 2 / 85 » On Term Rewriting Systems Having a Rational Derivation |
LOPSTR
2004
Springer
13 years 11 months ago
2004
Springer
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
PLILP
1994
Springer
13 years 9 months ago
1994
Springer
Abstract. Program slicing is a useful technique for debugging, testing, and analyzing programs. A program slice consists of the parts of a program which (potentially) affect the va...
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of term rewrite systems. In particular, triangular matrix interpretations over the natural numbers are known...
FOSSACS
2007
Springer
13 years 12 months ago
2007
Springer
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calcul...
RTA
2010
Springer
13 years 9 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...