325 search results - page 1 / 65 » Abstract Rewriting |
MFCS
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in...
ENTCS
2006
13 years 5 months ago
2006
act way to define rewriting logic Marc Aiguier a,1 , Diane Bahrami b , Delphine Longuet a a Universit
CADE
2008
Springer
14 years 5 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...
ICDT
2005
ACM
13 years 11 months ago
2005
ACM
d abstract) Foto Afrati1 and Rada Chirkova2 1 Electrical and Computing Eng., National Technical University of Athens, 157 73 Athens, Greece 2 Computer Science Department, North Car...
RTA
2005
Springer
13 years 11 months ago
2005
Springer
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...