On automating the extraction of programs from termination proofs
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 particu...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Universidad Autónoma de Bucaramanga
2003-12-01
|
Series: | Revista Colombiana de Computación |
Online Access: | https://revistas.unab.edu.co/index.php/rcc/article/view/1088 |
id |
doaj-42f496db82264efeb1786b455e6cc91b |
---|---|
record_format |
Article |
spelling |
doaj-42f496db82264efeb1786b455e6cc91b2020-11-25T02:43:11ZengUniversidad Autónoma de BucaramangaRevista Colombiana de Computación1657-28312539-21152003-12-0142On automating the extraction of programs from termination proofsFairouz Kamareddine0François Monin1Mauricio Ayala Rincón2Corresponding author. School of Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, ScotlandDepartement d'informatique, Universite de Bretagne Occidentale, CS 29837, 29238 Brest Cedex 3, France.Departamento de Matematica, Universidade de Brasilia. 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. https://revistas.unab.edu.co/index.php/rcc/article/view/1088 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Fairouz Kamareddine François Monin Mauricio Ayala Rincón |
spellingShingle |
Fairouz Kamareddine François Monin Mauricio Ayala Rincón On automating the extraction of programs from termination proofs Revista Colombiana de Computación |
author_facet |
Fairouz Kamareddine François Monin Mauricio Ayala Rincón |
author_sort |
Fairouz Kamareddine |
title |
On automating the extraction of programs from termination proofs |
title_short |
On automating the extraction of programs from termination proofs |
title_full |
On automating the extraction of programs from termination proofs |
title_fullStr |
On automating the extraction of programs from termination proofs |
title_full_unstemmed |
On automating the extraction of programs from termination proofs |
title_sort |
on automating the extraction of programs from termination proofs |
publisher |
Universidad Autónoma de Bucaramanga |
series |
Revista Colombiana de Computación |
issn |
1657-2831 2539-2115 |
publishDate |
2003-12-01 |
description |
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.
|
url |
https://revistas.unab.edu.co/index.php/rcc/article/view/1088 |
work_keys_str_mv |
AT fairouzkamareddine onautomatingtheextractionofprogramsfromterminationproofs AT francoismonin onautomatingtheextractionofprogramsfromterminationproofs AT mauricioayalarincon onautomatingtheextractionofprogramsfromterminationproofs |
_version_ |
1724770946087124992 |