203 search results - page 10 / 41 » Datatype-Generic Termination Proofs |
119
click to vote
TPHOL
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
125
Voted
RTA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
112
Voted
PPDP
2009
Springer
15 years 6 months ago
2009
Springer
We present direct proofs of termination of evaluation for typed delimited-control operators shift and reset using a variant of Tait’s method with context-based reducibility pred...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
101
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...