There are many powerful techniques for automated termination analysis of term rewriting. However, up to now they have hardly been used for real programming languages. We present a new approach which permits the application of existing techniques from term rewriting to prove termination of most functions defined in Haskell programs. In particular, we show how termination techniques for ordinary rewriting can be used to handle those features of Haskell which are missing in term rewriting (e.g., lazy evaluation, polymorphic types, and higher-order functions). We implemented our results in the termination prover AProVE and successfully evaluated them on existing Haskell libraries.
|Number of pages||39|
|Journal||ACM Transactions on Programming Languages and Systems|
|Publication status||Published - 2011|
Giesl, J., Raffelsieper, M., Schneider-Kamp, P., Swiderski, S., & Thiemann, R. (2011). Automated termination proofs for Haskell by term rewriting. ACM Transactions on Programming Languages and Systems, 33(2), 7-1/39. . https://doi.org/10.1145/1890028.1890030