DMCA
foetus – Termination Checker for Simple Functional Programs (1998)
Cached
Download Links
| Citations: | 14 - 1 self |
BibTeX
@MISC{Abel98foetus–,
author = {Andreas Abel},
title = {foetus – Termination Checker for Simple Functional Programs },
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
Keyphrases
foetus termination checker simple functional program lambda calculus well-founded structural order termination checker function parameter function call extraction lexical order simple functional language foetus graph completion html version check algorithm pattern matching program text many ready-to-run web-based example
