203 search results - page 13 / 41 » Datatype-Generic Termination Proofs |
111
Voted
DAGSTUHL
2007
15 years 3 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
130
Voted
ENTCS
2002
15 years 1 months ago
2002
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
144
Voted
ESSLLI
2009
Springer
14 years 11 months ago
2009
Springer
This paper describes cdiprover3 a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdip...
117
Voted
TPHOL
2008
IEEE
15 years 8 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
107
Voted
APAL
2008
15 years 2 months ago
2008
A simple cut elimination proof for arithmetic with epsilon symbol is used to establish termination of a modified epsilon substitution process. This opens a possibility of extensio...