✦ LIBER ✦

Refined program extraction from classical proofs

✍ Scribed by Ulrich Berger; Wilfried Buchholz; Helmut Schwichtenberg

Book ID: 104307147
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 167 KB
Volume: 114
Category: Article
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(01)00073-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Getting results from programs extracted

Getting results from programs extracted from classical proofs

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

Program Extraction from Normalization Pr

Program Extraction from Normalization Proofs

✍ Ulrich Berger; Stefan Berghofer; Pierre Letouzey; Helmut Schwichtenberg 📂 Article 📅 2006 🏛 Springer Netherlands 🌐 English ⚖ 306 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

Minimal from classical proofs

✍ Schwichtenberg, Helmut; Senjak, Christoph 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 162 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