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

Authors:
Yoriyuki Yamagata
Affiliations:
202, 3-47-13 Kugayama Suginami-ku, Tokyo, Japan
Venue:
Information and Computation
Year:
2004

Citing 9
Cited 0

Proofs and types

Proofs and types
A symmetric lambda calculus for classical program extraction

Information and Computation - special issue: symposium on theoretical aspects of computer software TACS '94
A Curry-Howard foundation for functional computation with control

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Confluency and strong normalizability of call-by-value λµ-calculus

Theoretical Computer Science
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
On the Relation between the Lambda-Mu-Calculus and the Syntactic Theory of Sequential Control

LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Classical Proofs as Programs

KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
A CPS-Translation of the Lambda-µ-Calculus

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Classical logic, continuation semantics and abstract machines

Journal of Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parigot [Computational Logic and Proof Theory, vol. 713, 1993, p. 263] suggested symmetric structural reduction rules to ensure unique representation of data types. We prove strong normalization of the second-order λµ-calculus with such rules.