Confluency and strong normalizability of call-by-value λµ-calculus

Authors:
Koji Nakazawa
Affiliations:
Department of Mathematics, Kyoto University, Kyoto 606-8502, Japan
Venue:
Theoretical Computer Science
Year:
2003

Citing 8
Cited 1

The system F of variable types, fifteen years later

Theoretical Computer Science
A syntactic theory of sequential control

Theoretical Computer Science
Proofs and types

Proofs and types
Lambda calculi with types

Handbook of logic in computer science (vol. 2)
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
A Simple Calculus of Exception Handling

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A CPS-Translation of the Lambda-µ-Calculus

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming

Strong normalization of the second-order symmetric λμ-calculus

Information and Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper proves the confluency and the strong normalizability of the call-by-value λµ-calculus with the domain-free style. The confluency of the system is proved by improving the parallel reduction method of Baba et al. The strong normalizability is proved by using the modified CPS-translation, which preserves the typability and the reduction relation. This paper defines the class of the reductions whose strictness is preserved by the modified CPS-translation to prove the strong normalizability.