232 search results - page 7 / 47 » Termination of linear bounded term rewriting systems |
AAECC
2007
Springer
14 years 11 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
BIRTHDAY
2005
Springer
15 years 4 months ago
2005
Springer
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
CADE
1992
Springer
15 years 3 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
101
click to vote
CADE
2010
Springer
14 years 10 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
AAECC
2010
Springer
14 years 11 months ago
2010
Springer