1458 search results - page 2 / 292 » Extended Term Rewriting Systems |
93
Voted
CADE
2001
Springer
16 years 22 days 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...
91
Voted
ENTCS
2007
15 years 11 days 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...
111
click to vote
LOPSTR
2004
Springer
15 years 5 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...
92
Voted
FSTTCS
2008
Springer
15 years 1 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...
106
Voted
AAECC
2005
Springer
15 years 10 days 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...