203 search results - page 2 / 41 » Datatype-Generic Termination Proofs |
CORR
2011
Springer
13 years 3 days ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
CORR
2000
Springer
13 years 5 months ago
2000
Springer
ICLP
2009
Springer
13 years 2 months ago
2009
Springer
TOPLAS
2011
13 years 3 days ago
2011
CORR
2010
Springer
13 years 3 months ago
2010
Springer
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...