References

BG96

Jürgen Brauburger and Jürgen Giesl.
Termination analysis for partial functions.
In Proceedings of the Third International Static Analysis Symposium (SAS'96), Aachen, Germany, Lecture Notes in Computer Science 1145, Springer-Verlag, 1996.

Gie97

Jürgen Giesl.
Termination of nested and mutually recursive algorithms.
Journal of Automated Reasoning 19: 1-29, 1997.

NPS90

Bengt Nordström, Kent Petersson, and Jan M. Smith.
Programming in Martin Löf's Type Theory: An Introduction.
Clarendon Press, Oxford, 1990.

Pau91

Lawrence C. Paulson.
ML for the Working Programmer.
Cambridge University Press, 1991.

Sli96

Konrad Slind.
Function definition in higher order logic.
In Proceedings of TPHOLs 96 (LNCS 1125), 1996.

Sli97a

Konrad Slind.
Derivation and use of induction schemes in higher-order logic.
In Proceedings of TPHOLs97 (LNCS 1275), 1997.

TTu97b

Alastair Telford and David Turner.
Ensuring Streams Flow.
In Michael Johnson, editor, Algebraic Methodology and Software Technology, 6th International Conference, AMAST '97, Sydney Australia, December 1997, volume 1349 of Lecture Notes in Computer Science, pages 509-523. AMAST, Springer-Verlag, December 1997.