103 search results - page 20 / 21 » Polygraphs for termination of left-linear term rewriting sys... |
163
click to vote
POPL
2007
ACM
15 years 9 months ago
2007
ACM
In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, Aspe...
AISC
2008
Springer
14 years 11 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
ERSHOV
1999
Springer
15 years 1 months ago
1999
Springer
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
115
click to vote
CADE
2005
Springer
15 years 9 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...