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

Sven Eric Panitz, Manfred Schmidt-Schauß. TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language. In Pascal Van Hentenryck, editor, Static Analysis, 4th International Symposium, SAS 97, Paris, France, September 8-10, 1997, Proceedings. Volume 1302 of Lecture Notes in Computer Science, pages 345-360, Springer, 1997.

Abstract

Abstract is missing.