"TEA: Automatically Proving Termination of Programs in a Non-strict ..."

Sven Eric Panitz, Manfred Schmidt-Schauß (1997)

> Home

Details and statistics

DOI: 10.1007/BFB0032752

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sas/PanitzS97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sas/PanitzS97
Sven Eric Panitz, Manfred Schmidt-Schauß:
TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language. SAS 1997: 345-360

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.