203 search results - page 19 / 41 » Datatype-Generic Termination Proofs |
111
click to vote
LOPSTR
1994
Springer
15 years 6 months ago
1994
Springer
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
104
click to vote
PLILP
1992
Springer
15 years 6 months ago
1992
Springer
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
122
click to vote
RTA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
159
click to vote
LICS
1995
IEEE
15 years 5 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
KBSE
1999
IEEE
15 years 6 months ago
1999
IEEE
CYNTHIA is a novel editor for the functional programming language ML in which each function definition is represented as the proof of a simple specification. Users of CYNTHIA edit...