An interpretation of \(\lambda \mu\)-calculus in \(\lambda\)-calculus.

DOI10.1016/S0020-0190(02)00300-9zbMath1042.68073OpenAlexW1522824251MaRDI QIDQ1853149

Ken-etsu Fujita

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00300-9

zbMATH Keywords

Formal semantics-modelFixed point combinatorsGödel-Gentzen translationType free -calculus

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• On proof terms and embeddings of classical substructural logics
• Control categories and duality: on the categorical semantics of the lambda-mu calculus
• Classical logic, continuation semantics and abstract machines
• Proofs of strong normalisation for second order classical natural deduction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An interpretation of \(\lambda \mu\)-calculus in \(\lambda\)-calculus.