99 search results - page 1 / 20 » Automated termination proofs for haskell by term rewriting |
44
Voted
TOPLAS
2011
14 years 4 months ago
2011
CADE
2001
Springer
15 years 9 months ago
2001
Springer
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. 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 auto...
IANDC
2008
14 years 9 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...