Sciweavers

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

14

ENTCS
2002

favoriteEmaildiscussreport

129views more ENTCS 2002»

Eliminating Proofs from Programs

13 years 4 months ago

Eliminating Proofs from Programs

Download www.cs.cmu.edu

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.

Femke van Raamsdonk, Paula Severi

Real-time Traffic

ENTCS 2002 | Lambda Term | Pure Type Systems | Simply Typed Lambda Calculus |

claim paper

Related Content

» From Proofs to Focused Proofs A Modular Proof of Focalization in Linear Logic

» Elimination of Ghost Variables in Program Logics

» Automatic uselesscode elimination for HOT functional programs

» A Formal Quantifier Elimination for Algebraically Closed Fields

» Eliminating Covert Flows with Minimum Typings

» Logic Program Specialisation With Deletion of Useless Clauses

» Eliminating Dependent Pattern Matching

» A Simple Proof That SuperConsistency Implies Cut Elimination

» A Verifiable Control Flow Aware Constraint Analyzer for Bounds Check Elimination

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	ENTCS
Authors	Femke van Raamsdonk, Paula Severi

Comments (0)