July 16, 1998
We introduce a simple functional language foetus (lambda calculus with tuples, constructors and pattern matching) supplied with a termination checker. This checker tries to find a well-founded structural order on the parameters on the given function to prove termination. The components of the check algorithm are: function call extraction out of the program text, call graph completion and finding a lexical order for the function parameters. The HTML version of this paper contains many ready-to-run Web-based examples.
Download ML source foetus.tar.gz!
![[*]](http://www.tcs.informatik.uni-muenchen.de/icons/foot_motif.gif){kind=icon}