498 search results - page 1 / 100 » Term Rewriting |
LOPSTR
2004
Springer
13 years 9 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...
ENTCS
2007
13 years 4 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...
PLILP
1998
Springer
13 years 8 months ago
1998
Springer
A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system (R), ...
MFCS
1997
Springer
13 years 8 months ago
1997
Springer
Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in...
CADE
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...