498 search results - page 30 / 100 » Term Rewriting |
ENTCS
2008
14 years 9 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...
RTA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
115
click to vote
MCMASTER
1993
15 years 1 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
CSL
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
TCS
1998
14 years 9 months ago
1998
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...