2 search results - page 1 / 1 » A Type-Based Termination Criterion for Dependently-Typed Hig... |
RTA
2004
Springer
13 years 10 months ago
2004
Springer
Several authors devised type-based termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent type...
CORR
2006
Springer
13 years 4 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 ...