Skip navigation
Please use this identifier to cite or link to this item:
Files in This Item:
File Description SizeFormat 
ARTIGO_AutomatingExtractionPrograms.pdf302,76 kBAdobe PDFView/Open
Title: On automating the extraction of programs from termination proofs
Authors: Kamareddiney, Fairouz
Monin, François
Ayala Rincón, Mauricio
Assunto:: Sistemas de transmissão de dados
Programação (Computadores)
Issue Date: 2004
Publisher: Universidad Autónoma de Bucaramanga (Colômbia)
Citation: KAMAREDDINEY, Fairouz; MONIN, François; AYALA RYNCÓN, Mauricio. On automating the extraction of programs from termination proofs. Revista Colombiana de Computación, Bucaramanga, v. 4, n.2, p. 29-48, 2004. Disponível em: <>. Acesso em: 07 mar. 2013.
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 find a formal proof of the totality of the given function. Because of the particular logical framework, usually such approaches make it difficult to use termination techniques such as those in rewriting theory. We overcome this difficulty 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.
Licença:: Revista Colombiana de Computación - Esta obra está licenciada sob uma Licença Creative Commons (Attribution 3.0 Unported (CC BY 3.0)). Fonte: Acesso em: 05 mar. 2013.
Appears in Collections:CIC - Artigos publicados em periódicos

Show full item record Recommend this item " class="statisticsLink btn btn-primary" href="/handle/10482/12403/statistics">

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.