203 search results - page 8 / 41 » Datatype-Generic Termination Proofs |
101
Voted
IANDC
2008
15 years 1 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
114
Voted
LICS
2010
IEEE
15 years 9 days ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
CADE
2006
Springer
16 years 2 months ago
2006
Springer
113
click to vote
CSL
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
150
click to vote
PEPM
2010
ACM
15 years 3 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...