498 search results - page 20 / 100 » Term Rewriting |
88
Voted
AAECC
2008
Springer
14 years 9 months ago
2008
Springer
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...
BIRTHDAY
2007
Springer
15 years 3 months ago
2007
Springer
In contrast to the current general way of developing tools for proving termination automatically, this paper intends to show an alternative program based on using on the one hand t...
82
Voted
CTRS
1992
15 years 1 months ago
1992
ded abstract of this paper is published in the proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, Pont- -Mousson, 1992 1
109
click to vote
RTA
2011
Springer
14 years 15 days ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
PPDP
2007
Springer
15 years 3 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...