TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language

Cite this paper

@inproceedings{Panitz1997TEAAP, title={TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language}, author={Sven Eric Panitz and Manfred Schmidt-Schau\ss}, booktitle={SAS}, year={1997} }