203 search results - page 14 / 41 » Datatype-Generic Termination Proofs |
134
click to vote
CSL
2009
Springer
16 years 16 days 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...
135
click to vote
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
140
click to vote
CADE
1992
Springer
15 years 10 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
156
click to vote
LICS
1991
IEEE
15 years 9 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,...
167
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Sized types are a modular and theoretically well-understood tool for checking termination of recursive and productivity of corecursive definitions. The essential idea is to track ...