Program extraction from normalization proofs

Studia Logica 82 (1):25 - 49 (2006)
This paper describes formalizations of Tait's normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs programs are machine-extracted that implement variants of the well-known normalization-by-evaluation algorithm. The case study is used to test and compare the program extraction machineries of the three proof assistants in a non-trivial setting.
Keywords Normalization by evaluation  typed lambda calculus  realizability  program extraction from proofs
Categories (categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,357
External links
  •   Try with proxy.
  •   Try with proxy.
  • Through your library Configure
    References found in this work BETA

    No references found.

    Citations of this work BETA
    Karl-Heinz Niggl (1995). Towards the Computational Complexity Of. Annals of Pure and Applied Logic 75 (1-2):153-178.
    Similar books and articles

    Monthly downloads

    Sorry, there are not enough data points to plot this chart.

    Added to index


    Total downloads


    Recent downloads (6 months)


    How can I increase my downloads?

    My notes
    Sign in to use this feature

    Start a new thread
    There  are no threads in this forum
    Nothing in this forum yet.