On automating the extraction of programs from termination proofs

  • Fairouz Kamareddine Corresponding author. School of Mathematical and Computer Sciences, Heriot-Watt University, Edinburgh, Scotland
  • François Monin Departement d'informatique, Universite de Bretagne Occidentale, CS 29837, 29238 Brest Cedex 3, France.
  • Mauricio Ayala Rincón Departamento de Matematica, Universidade de Brasilia.

Resumen

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.

Cómo citar
Kamareddine, F., Monin, F., & Ayala Rincón, M. (2003). On automating the extraction of programs from termination proofs. Revista Colombiana De Computación, 4(2), 1-20. Recuperado a partir de https://revistas.unab.edu.co/index.php/rcc/article/view/1088

Descargas

La descarga de datos todavía no está disponible.
Publicado
2003-12-01
Sección
Artículo de investigación científica y tecnológica