99 search results - page 13 / 20 » Automated termination proofs for haskell by term rewriting |
146
click to vote
FROCOS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...
157
click to vote
TACAS
2010
Springer
16 years 28 days ago
2010
Springer
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
211
click to vote
LPAR
2007
Springer
16 years 2 days ago
2007
Springer
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
177
click to vote
LOPSTR
2009
Springer
16 years 15 days ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
178
click to vote
LOPSTR
2009
Springer
16 years 15 days ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...