1385 search results - page 3 / 277 » Natural Rewriting for General Term Rewriting Systems |
FSTTCS
2010
Springer
13 years 4 months ago
2010
Springer
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
BIRTHDAY
2007
Springer
14 years 12 days 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...
FOSSACS
2004
Springer
13 years 11 months ago
2004
Springer
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down system...
IANDC
2008
13 years 6 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
PPDP
2007
Springer
14 years 10 days 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...