Automated termination proofs for haskell by term rewriting

Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann. Automated termination proofs for haskell by term rewriting. ACM Transactions on Programming Languages and Systems, 33(2):7, 2011. [doi]

@article{GieslRSST11,
  title = {Automated termination proofs for haskell by term rewriting},
  author = {Jürgen Giesl and Matthias Raffelsieper and Peter Schneider-Kamp and Stephan Swiderski and René Thiemann},
  year = {2011},
  doi = {10.1145/1890028.1890030},
  url = {http://doi.acm.org/10.1145/1890028.1890030},
  tags = {term rewriting, Haskell, termination, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/GieslRSST11},
  cites = {0},
  citedby = {0},
  journal = {ACM Transactions on Programming Languages and Systems},
  volume = {33},
  number = {2},
  pages = {7},
}