Treffer: Automated Termination Proofs for Haskell by Term Rewriting.

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. [ABSTRACT FROM AUTHOR]

Copyright of ACM Transactions on Programming Languages & Systems is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)