23201 search results - page 7 / 4641 » Rewriting Systems with Data |
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...
ICDE
2009
IEEE
13 years 5 months ago
2009
IEEE
There is much effort to develop comprehensive support for the storage and querying of XML data in database management systems. The major developers have extended their systems to h...
ICTAC
2004
Springer
14 years 1 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
IASTEDSEA
2004
13 years 9 months ago
2004
Program transformation through the repeated application of simple rewrite rules is conducive to formal verification. In practice, program transformation oftentimes requires data t...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...