1385 search results - page 10 / 277 » Natural Rewriting for General Term Rewriting Systems |
136
click to vote
AMAST
2010
Springer
14 years 9 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 ...
TCS
2002
15 years 1 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 ...
157
Voted
FROCOS
2011
Springer
14 years 1 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...
104
click to vote
RTA
1993
Springer
15 years 6 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 ⊆ ...
114
click to vote
ENTCS
2008
15 years 1 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...