Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
428390 | Information Processing Letters | 2006 | 8 Pages |
Abstract
This paper proposes a new proof method for strong normalization of classical natural deduction and calculi with control operators. For this purpose, we introduce a new CPS-translation, continuation and garbage passing style (CGPS ) translation. We show that this CGPS-translation method gives simple proofs of strong normalization of λμ→∧∨⊥, which is introduced in [P. de Groote, Strong normalization of classical natural deduction with disjunction, in: S. Abramsky (Ed.), Typed Lambda Calculi and Applications, 5th International Conference, TLCA 2001, in: Lecture Notes in Comput. Sci., vol. 2044, Springer, Berlin, 2001, pp. 182–196] by de Groote and corresponds to the classical natural deduction with disjunctions and permutative conversions.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics