23201 search results - page 65 / 4641 » Rewriting Systems with Data |
100
Voted
FORTE
2010
15 years 2 months ago
2010
Abstract. Rule-based specifications have been very successful as a declarative approach in many domains, due to the handy yet solid foundations offered by rule-based machineries li...
106
click to vote
DBISP2P
2006
Springer
15 years 4 months ago
2006
Springer
Sharing of structured data in P2P overlays is a challenging problem, especially in the absence of a global schema. The nature of structured data stored in the overlay enforces stri...
129
Voted
LCR
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. Modern dialects of Fortran enjoy wide use and good support on highperformance computers as performance-oriented programming languages. By providing the ability to express...
119
Voted
RTA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
91
Voted
CADE
1992
Springer
15 years 5 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...