Corrigendum to "Strong normalization proof with CPS-translation for second order classical natural deduction"
نویسندگان
چکیده
Our paper [1] contains a serious error. Proposition 4.6 of [1] is actually false and hence our strong normalization proof does not work for the Curry-style λμ-calculus. However, our method still can show that (1) the correction of Proposition 5.4 of [2], and (2) the correction of the proof of strong normalization of Church-style λμ-calculus by CPS-translation. Firstly, our method is still effective for the correction of Proposition 5.4 of [2]. The proposition claims that for any Curry-style λμ-term u, which is not necessarily typable, if u is strongly normalizable, then u is strongly normalizable too. But its proof does not work, since Proposition 5.1 (i) of [2] is false because of erasing-continuation. Our method proves the similar result for the Curry-style λμ-calculus by Propositions 4.3 and 4.12 of [1].
منابع مشابه
Strong normalization of classical natural deduction with disjunctions
This paper proves strong normalization of classical natural deduction with disjunction and permutative conversions, by using CPS-translation and augmentations. By them, this paper also proves strong normalization of classical natural deduction with general elimination rules for implication and conjunction, and their permutative conversions. This paper also proves natural deduction can be embedd...
متن کاملStabilization—An Alternative to Double-Negation Translation for Classical Natural Deduction
A new proof of strong normalization of Parigot’s second-order λμ-calculus is given by a reduction-preserving embedding into system F (second-order polymorphic λ-calculus). The main idea is to use the least stable supertype for any type. These non-strictly positive inductive types and their associated iteration principle are available in system F, and allow to give a translation vaguely related ...
متن کامل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...
متن کاملCorrespondence between Normalization of CND and Cut-Elimination of LKT
We study the correspondence between normalization of two well-known constructive classical logic, namely CND (Parigot 92) and LKT (Danos-Joinet-Schellinx 93). For this, we develop term calculi. We then show translation from CND to LKT and show the simulation theorem; the normalization of CND can be simulated by cut-elimination of LKT. Furthermore, we argue that the translation can be considered...
متن کاملCall-By-Value λμ-calculus and Its Simulation by the Cut-Elimination Procedure for LKQ
We show Call-By-Value(CBV) normalization forCND (Parigot 92) can be simulated by by cut-elimination for LKQ (Danos-JoinetSchellinx 93), namely q-protocol. For this, a new term calculus was made for each classical logic. A term calculus for CND is a CBV version of Parigot’s λμ-calculus. A completely new term calculus for LKQ is presented in a style of classical extension of λ-calculus with a let...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 68 شماره
صفحات -
تاریخ انتشار 2003