 
Summary: Electronic Notes in Theoretical Computer Science 67 (2002)
URL: http://www.elsevier.nl/locate/entcs/volume67.html 20 pages
On automating the extraction of programs
from proofs using product types
Fairouz Kamareddine 1
School of Mathematical and Computer Sciences, HeriotWatt University,
Edinburgh, Scotland
Francois Monin 2
IRISA, Campus de Beaulieu, 35 042 Rennes Cedex, France
Mauricio AyalaRincon 3
Departamento de Matematica, Universidade de Braslia, Braslia D.F., Brasil
Abstract
We investigate an automated program synthesis system 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 diÆcult to use techniques such as those in rewriting
theory. We overcome this diÆculty 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.
