Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

TLCA
1993
Springer

favoriteEmaildiscussreport

106views Theoretical Computer Science» more TLCA 1993»

Program Extraction from Normalization Proofs

13 years 10 months ago

Program Extraction from Normalization Proofs

Download www.mathematik.uni-muenchen.de

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.

Ulrich Berger

Real-time Traffic

Formal Proofs Programs | Proof Assistants | Tait’s Normalization Proof | Theoretical Computer Science | TLCA 1993 |

claim paper

Related Content

» Program Extraction From Proofs of Weak Head Normalization

» Extracting a Normalization Algorithm in IsabelleHOL

» Extracting Programs from Constructive HOL Proofs Via IZF SetTheoretic Semantics

» Eliminating Proofs from Programs

» Contextbased proofs of termination for typed delimitedcontrol operators

» Extracting Computer Algebra Programs from Statements

» Program Extraction from Large Proof Developments

» Program Extraction from Classical Proofs

» Automatic Complexity Analysis for Programs Extracted from Coq Proof

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1993
Where	TLCA
Authors	Ulrich Berger

Comments (0)