✦ LIBER ✦

Program Extraction from Normalization Proofs

✍ Scribed by Ulrich Berger; Stefan Berghofer; Pierre Letouzey; Helmut Schwichtenberg

Book ID: 106538876
Publisher: Springer Netherlands
Year: 2006
Tongue: English
Weight: 306 KB
Volume: 82
Category: Article
ISSN: 0039-3215
DOI: 10.1007/s11225-006-6604-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Type

[Lecture Notes in Computer Science] Typed Lambda Calculi and Applications Volume 664 || Program extraction from normalization proofs

✍ Bezem, Marc; Groote, Jan Friso 📂 Article 📅 1993 🏛 Springer-Verlag ⚖ 734 KB

Refined program extraction from classica

Refined program extraction from classical proofs

✍ Ulrich Berger; Wilfried Buchholz; Helmut Schwichtenberg 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Getting results from programs extracted

Getting results from programs extracted from classical proofs

✍ C. Raffalli 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 307 KB

Light Dialectica Program Extraction from

Light Dialectica Program Extraction from a Classical Fibonacci Proof

✍ Mircea-Dan Hernest 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 292 KB

Writing Constructive Proofs Yielding Eff

Writing Constructive Proofs Yielding Efficient Extracted Programs

✍ Aleksey Nogin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Eliminating Proofs from Programs

✍ Femke van Raamsdonk; Paula Severi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 207 KB

This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need to be removed. This is done by a reduction relation → . We study the combination of β-reduction and -reduction, both in