✦ LIBER ✦

Getting results from programs extracted from classical proofs

✍ Scribed by C. Raffalli

Book ID: 108280940
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 307 KB
Volume: 323
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.03.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Refined program extraction from classica

Refined program extraction from classical proofs

✍ Ulrich Berger; Wilfried Buchholz; Helmut Schwichtenberg 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 167 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

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

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

Formal Verification of Numerical Program

Formal Verification of Numerical Programs: From C Annotated Programs to Mechanical Proofs

✍ Sylvie Boldo; Claude Marché 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 785 KB

Getting results from your MRP system

✍ John C. Anderson; Roger G. Schroeder 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 715 KB