1385 search results - page 10 / 277 » Natural Rewriting for General Term Rewriting Systems |
111
Voted
AMAST
2010
Springer
14 years 6 months ago
2010
Springer
mu-term is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost ...
81
Voted
TCS
2002
14 years 11 months ago
2002
ELAN implements computational systems, a concept that combines two first class entities: rewrite rules and rewriting strategies. ELAN can be used either as a logical framework or ...
136
click to vote
FROCOS
2011
Springer
13 years 11 months ago
2011
Springer
Many functional programs and higher order term rewrite systems contain, besides higher order rules, also a significant first order part. We discuss how an automatic termination p...
RTA
1993
Springer
15 years 3 months ago
1993
Springer
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 ⊆ ...
ENTCS
2008
14 years 11 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...