1458 search results - page 2 / 292 » Extended Term Rewriting Systems |
CADE
2001
Springer
14 years 7 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
ENTCS
2007
13 years 7 months ago
2007
Nominal rewriting introduced a novel method of specifying rewriting on syntax-with-binding. We extend this treatment of rewriting with hierarchy of variables representing increasi...
LOPSTR
2004
Springer
14 years 21 days 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...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
AAECC
2005
Springer
13 years 7 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...