On automating the extraction of programs from proofs using product types

Fairouz Kamareddine, François Monin, Mauricio Ayala-Rincón

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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 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 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. ©2002 Published by Elsevier Science B.V.

Original languageEnglish
Pages (from-to)239-269
Number of pages31
JournalElectronic Notes in Theoretical Computer Science
Publication statusPublished - Oct 2002
Event9th Workshop on Logic, Language, Information and Computation - Rio de Janeiro, Brazil
Duration: 30 Jul 20022 Aug 2002


  • Automated termination
  • Product types
  • Program extraction


Dive into the research topics of 'On automating the extraction of programs from proofs using product types'. Together they form a unique fingerprint.

Cite this