Eliminating Proofs from Programs

✍ Scribed by Femke van Raamsdonk; Paula Severi

• Book ID: 104444862
• Publisher: Elsevier Science
• Year: 2002
• Tongue: English
• Weight: 207 KB
• Volume: 70
• Category: Article
• ISSN: 1571-0661
• DOI: 10.1016/s1571-0661(04)80505-x

✦ Synopsis

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 the setting of simply typed lambda calculus and for pure type systems. In the general setting the properties confluence, subject reduction, and strong normalization are studied.