Strong normalization results by translation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong normalization results by translation

We prove the strong normalization of full classical natural deduction (i.e. with conjunction, disjunction and permutative conversions) by using a translation into the simply typed λμ-calculus. We also extend Mendler’s result on recursive equations to this system.

متن کامل

A -to-CL Translation for Strong Normalization

We introduce a simple translation from -calculus to combinatory logic (cl) such that: A is an sn -term i the translation result of A is an sn term of cl (the reductions are -reduction in -calculus and weak reduction in cl). None of the conventional translations from -calculus to cl satisfy the above property. Our translation provides a simpler sn proof of Godel's -calculus by the ordinal numbe...

متن کامل

Arithmetical proofs of strong normalization results for symmetric lambda calculi

We give arithmetical proofs of the strong normalization of two symmetric λ-calculi corresponding to classical logic. The first one is the λμμ̃-calculus introduced by Curien & Herbelin. It is derived via the Curry-Howard correspondence from Gentzen’s classical sequent calculus LK in order to have a symmetry on one side between “program” and “context” and on other side between “call-by-name” and “...

متن کامل

Arithmetical Proofs of Strong Normalization Results for Symmetric ?-calculi

We give arithmetical proofs of the strong normalization of two symmetric λ-calculi corresponding to classical logic. The first one is the λμμ̃-calculus introduced by Curien & Herbelin. It is derived via the Curry-Howard correspondence from Gentzen’s classical sequent calculus LK in order to have a symmetry on one side between “program” and “context” and on other side between “call-by-name” and “...

متن کامل

Strong normalization proofs by CPS-translations

In this paper, we propose a new proof method for strong normalization of calculi with control operators, and, by this method, we prove strong normalization of the system λμ→∧∨⊥ , which is introduced in [3] by de Groote and corresponds to the classical natural deduction with disjunctions and permutative conversions by the Curry-Howard isomorphism. For our method, we introduce a new CPS-translati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2010

ISSN: 0168-0072

DOI: 10.1016/j.apal.2010.02.002