20 search results - page 2 / 4 » Path Orderings for Termination of Associative-Commutative Re... |
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to terms of a typed ...
FROCOS
2007
Springer
15 years 3 months ago
2007
Springer
We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers pe...
LICS
1991
IEEE
15 years 1 months ago
1991
IEEE
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
ESSLLI
2009
Springer
14 years 7 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...