1000 search results - page 18 / 200 » Nominal rewriting systems |
CTCS
1997
Springer
13 years 11 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
AISC
2004
Springer
13 years 11 months ago
2004
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. We show how polynomial interpretations with negative coefficients, like x - 1 for...
AISC
2006
Springer
13 years 11 months ago
2006
Springer
We prove that the properties of reachability, joinability and confluence are undecidable for flat TRSs. Here, a TRS is flat if the heights of the left and right-hand sides of each ...
PPDP
2001
Springer
13 years 12 months ago
2001
Springer
We define a transformation from a left-linear constructor-based conditional rewrite system into an overlapping inductively sequential rewrite system. This transformation is sound...
RTA
2009
Springer
14 years 2 months ago
2009
Springer
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...