882 search results - page 53 / 177 » A Taste of Rewrite Systems |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
ANLP
2000
13 years 9 months ago
2000
We report on a method for utilising corpora collected in natural settings. It is based on distilling re-writing natural dialogues to elicit the type of dialogue that would occur i...
VL
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper outlines a method to specify a wide range of diagrams by hypergraphs and diagram dynamics by hypergraph rewrite rules. The specification of a diagram language together ...
WOODPECKER
2001
13 years 9 months ago
2001
Maude is an executable rewriting logic language specially well suited for the specification of object-oriented open and distributed systems. In this paper we explore the possibilit...
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...