A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Strong Normalization of Second Order Symmetric Lambda-mu Calculus
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
A Simple Calculus of Exception Handling
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus
Higher-Order and Symbolic Computation
Strong normalization of classical natural deduction with disjunction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Monadic Translation of Intuitionistic Sequent Calculus
Types for Proofs and Programs
Continuation-passing style and strong normalisation for intuitionistic sequent calculi
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
An isomorphism between cut-elimination procedure and proof reduction
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
| Hi-index | 0.89 |
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.