foetus -- Termination Checker for Simple Functional Programs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910521172688896 |
|---|---|
| author | Abel, Andreas |
| author_facet | Abel, Andreas |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_06924 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | foetus -- Termination Checker for Simple Functional Programs Abel, Andreas Programming Languages Logic in Computer Science 68N18 F.3.2 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. |
| title | foetus -- Termination Checker for Simple Functional Programs |
| topic | Programming Languages Logic in Computer Science 68N18 F.3.2 |
| url | https://arxiv.org/abs/2407.06924 |