3 search results - page 1 / 1 » Termination of Rewriting with and Automated Synthesis of For... |
CORR
2010
Springer
13 years 3 months ago
2010
Springer
CSL
2009
Springer
13 years 12 months ago
2009
Springer
We investigate the relationship between two independently developed termination techniques for rst and higher-order rewrite systems. On the one hand, sized-types based termination...
LICS
1991
IEEE
13 years 8 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,...