Sciweavers

74 search results - page 3 / 15
» Extending Context-Sensitivity in Term Rewriting
Sort
View
68
Voted
CTRS
1990
15 years 1 months ago
Extended Term Rewriting Systems
Jan Willem Klop, Roel C. de Vrijer
RTA
1993
Springer
15 years 1 months ago
Bi-rewriting, a Term Rewriting Technique for Monotonic Order Relations
We propose an extension of rewriting techniques to derive inclusion relations a ⊆ b between terms built from monotonic operators. Instead of using only a rewriting relation ⊆ â...
Jordi Levy, Jaume Agustí-Cullell
RTA
2007
Springer
15 years 3 months ago
Proving Termination of Rewrite Systems Using Bounds
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
Martin Korp, Aart Middeldorp
BIRTHDAY
2005
Springer
15 years 3 months ago
Reduction Strategies for Left-Linear Term Rewriting Systems
Huet and L´evy (1979) showed that needed reduction is a normalizing strategy for orthogonal (i.e., left-linear and non-overlapping) term rewriting systems. In order to obtain a de...
Yoshihito Toyama
CADE
2008
Springer
15 years 10 months ago
Modularity of Confluence
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...
Vincent van Oostrom