An interpretation of λµ-calculus in λ-calculus

Authors:
Ken-etsu Fujita
Affiliations:
Shimane University, Department of Mathematics and Computer Science, Matsue 690-8504, Japan
Venue:
Information Processing Letters
Year:
2002

Citing 8
Cited 1

A formulae-as-type notion of control

POPL '90 Proceedings of the 17th 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
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 semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Continuation models are universal for lambda-mu-calculus

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Control categories and duality: on the categorical semantics of the lambda-mu calculus

Mathematical Structures in Computer Science
Classical logic, continuation semantics and abstract machines

Journal of Functional Programming

A sound and complete CPS-translation for λµ-calculus

TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that any λ-model gives rise to a λµ-model, in the sense that if we have M =λµ N in the equational theory of type free λµ-calculus then [[M]] = D [[N]] holds true for some structure 〈[[-]], D〉 induced from a λ-model. The construction of λµ-models can be given by the use of a fixed point operator and the Gödel-Gentzen translation.