203 search results - page 2 / 41 » Datatype-Generic Termination Proofs |
142
Voted
CORR
2011
Springer
14 years 10 months 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...
98
Voted
CORR
2000
Springer
15 years 3 months ago
2000
Springer
141
Voted
ICLP
2009
Springer
15 years 1 months ago
2009
Springer
79
Voted
TOPLAS
2011
14 years 10 months ago
2011
119
Voted
CORR
2010
Springer
15 years 1 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...