A CPS-translation of the -calculus
From MaRDI portal
(Redirected from A CPS-translation of the -calculus)
A CPS-translation of the \(\lambda\mu\)-calculus
A CPS-translation of the \(\lambda\mu\)-calculus
Recommendations
Cited in
(22)- A provably correct translation of the \(\lambda \)-calculus into a mathematical model of C++
- CPS-translation as adjoint
- The Cooper storage idiom
- Confluency and strong normalizability of call-by-value -calculus
- Strong normalization of the second-order symmetric \(\lambda \mu\)-calculus
- Domain-free -calculus
- Parigot's second order -calculus and inductive types
- Linear is CP (more or less)
- Quantifiers in Japanese
- A computational interpretation of the -calculus
- Proofs, lambda terms and control operators
- scientific article; zbMATH DE number 2053247 (Why is no real title available?)
- A sound and complete CPS-translation for -calculus
- An estimation for the lengths of reduction sequences of the -calculus
- Strong normalization proof with CPS-translation for second order classical natural deduction
- scientific article; zbMATH DE number 1910399 (Why is no real title available?)
- Programming and Proving with Classical Types
- The approximation theorem for the \(\Lambda_{\mu}\)-calculus
- Relational Parametricity and Control
- Stabilization -- an alternative to double-negation translation for classical natural deduction
- A linear translation from CTL^* to the first-order modal -calculus
- Pedagogical second-order \(\lambda \)-calculus
This page was built for publication: A CPS-translation of the \(\lambda\mu\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4954443)