"Automated termination proofs for haskell by term rewriting."

Jürgen Giesl et al. (2011)

> Home

Details and statistics

DOI: 10.1145/1890028.1890030

access: closed

type: Journal Article

metadata version: 2019-09-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/toplas/GieslRSST11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toplas/GieslRSST11
Jürgen Giesl, Matthias Raffelsieper, Peter Schneider-Kamp, Stephan Swiderski, René Thiemann:
Automated termination proofs for haskell by term rewriting. ACM Trans. Program. Lang. Syst. 33(2): 7:1-7:39 (2011)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.