On automating the extraction of programs from termination proofs
Abstract
We investigate an automated program synthesis system that is based on the paradigm of programming by proofs. To automatically extract a term that computes a recursive function given by a set of equations the system must nd a formal proof of the totality of the given function. Because of the particular logical framework, usually such approaches make it dicult to use termination techniques such as those in rewriting theory. We overcome this diculty for the automated system that we consider by exploiting product types. As a consequence, this would enable the incorporation of termination techniques used in other areas while still extracting programs.
Keywords: Program extraction, product types, termination, ProPre system.
How to Cite
Downloads
Downloads
Published
Issue
Section
License
The publication of an article in the Colombian Journal of Computing, requires authorization by the author, through the letter of assignment, which authorizes the Editor of this Journal for partial or total reproduction, for academic purposes, not commercial or lucrative, according to the Open Access philosophy on Web sites and on the Internet, such as networks, bibliographic databases, indexes, directories or any other means of electronic reproduction, always referring to the author(s) and the journal, as stipulated in Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Altmetric
| Article metrics | |
|---|---|
| Abstract views | 463 |
| Galley views | 151 |
| PDF Views | 151 |
| HTML views | 0 |
| Other views | 0 |


