256 search results - page 1 / 52 » Using groups for investigating rewrite systems |
166
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with an equational specification. These tools consist in introducing...
206
Voted
RCC
2002
15 years 6 months ago
2002
In recent years Arvind's Group at MIT has shown the usefulness of term rewriting theory for the specification of processor architectures. In their approach processors specifi...
172
Voted
MFCS
2007
Springer
16 years 26 days ago
2007
Springer
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
172
click to vote
PPDP
2007
Springer
16 years 25 days 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...
164
Voted
FROCOS
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...