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.
@inproceedings{PanitzS97,
title = {TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language},
author = {Sven Eric Panitz and Manfred Schmidt-Schauß},
year = {1997},
tags = {programming languages, functional programming, termination},
researchr = {https://researchr.org/publication/PanitzS97},
cites = {0},
citedby = {0},
pages = {345-360},
booktitle = {Static Analysis, 4th International Symposium, SAS 97, Paris, France, September 8-10, 1997, Proceedings},
editor = {Pascal Van Hentenryck},
volume = {1302},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-63468-1},
}