Program Extraction from Proofs of Weak Head Normalization

Forfattere

  • Malgorzata Biernacka
  • Olivier Danvy
  • Kristian Støvring

DOI:

https://doi.org/10.7146/brics.v12i12.21878

Resumé

We formalize two proofs of weak head normalization for the simply typed lambda-calculus in first-order minimal logic: one for normal-order reduction, and one for applicative-order reduction in the object language. Subsequently we use Kreisel's modified realizability to extract evaluation algorithms from the proofs, following Berger; the proofs are based on Tait-style reducibility predicates, and hence the extracted algorithms are instances of (weak head) normalization by evaluation, as already identified by Coquand and Dybjer.

Downloads

Publiceret

2005-04-11

Citation/Eksport

Biernacka, M., Danvy, O., & Støvring, K. (2005). Program Extraction from Proofs of Weak Head Normalization. BRICS Report Series, 12(12). https://doi.org/10.7146/brics.v12i12.21878

Nummer

Nr. 12 (2005): RS-12 Program Extraction from Proofs of Weak Head Normalization

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).