367 search results - page 3 / 74 » A Rewriting Logic Sampler |
PPDP
2007
Springer
14 years 2 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...
ENTCS
2000
13 years 7 months ago
2000
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
We present a novel proof of Toyama's famous modularity of confluence result for term rewriting systems. Apart from being short and intuitive, the proof is modular itself in th...
CADE
2006
Springer
13 years 11 months ago
2006
Springer
PPDP
2004
Springer
14 years 1 months ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...