Sciweavers

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

11

CORR
2008
Springer

favoriteEmaildiscussreport

61views Education» more CORR 2008»

Short proofs of strong normalization

13 years 5 months ago

Short proofs of strong normalization

Download www-users.mat.umk.pl

This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, and all the permutative reductions. The normalization proofs use translations of terms and types of ,,, to terms and types of and from F,,,,, to F,.

Aleksander Wojdyga

Real-time Traffic

CORR 2008 | Education | Logical Connectives | Paper | Permutative Reductions |

claim paper

Related Content

» Strong normalization proofs by CPStranslations

» Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi

» Modified Realizability Toposes and Strong Normalization Proofs

» Strong Normalization of Proof Nets Modulo Structural Congruences

» A Formalization of the Strong Normalization Proof for System F in LEGO

» A Formalization of Strong Normalization for SimplyTyped LambdaCalculus and System F

» Strong normalization property for second order linear logic

» On strong normalization and type inference in the intersection type discipline

» On Strong Normalization of the Calculus of Constructions with TypeBased Termination

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Aleksander Wojdyga

Comments (0)