foetus -- Termination Checker for Simple Functional Programs
<|reference_start|>foetus -- Termination Checker for Simple Functional Programs: 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.<|reference_end|>
@article{abel2024foetus,
    title={foetus -- Termination Checker for Simple Functional Programs},
    author={Andreas Abel},
    journal={arXiv preprint arXiv:2407.06924},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.06924},
    primaryClass={cs.PL cs.LO}
}