Skip to search formSkip to main contentSkip to account menu

Lambda-mu calculus

Known as: Λμ calculus 
In mathematical logic and computer science, the lambda-mu calculus is an extension of the lambda calculus introduced by M. Parigot. It introduces two… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Computability theoryComputer scienceCurry–Howard correspondenceIdentifier

Broader (1)

Lambda calculus

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The atomic lambda-mu calculus
A cornerstone of theoretical computer science is the Curry-Howard correspondence where formulas are types, proofs are programs… 
2014
2014
Reduction System for Extensional Lambda-mu Calculus
The Λμ-calculus is an extension of Parigot’s λμ-calculus. For the untyped Λμ-calculus, Saurin proved some fundamental properties… 
2012
2012
Knowledge Matters: The Long‐Run Determinants of State Income Growth
State per capita income differences narrowed considerably between 1939 and 1976. However, this convergence has been incomplete… 
Highly Cited
2011
Highly Cited
2011
New physics in b → sμ+μ−: CP-violating observables
A bstractWe perform a comprehensive study of the impact of new-physics operators with different Lorentz structures on CP… 
2011
2011
On the denotational semantics of the untyped lambda-mu calculus
Starting with the idea of reflexive objects in Selinger’s control categories, we define three different denotational models of… 
2007
2007
Improvement of the muscle fractional multimodel for low-rate stimulation
2006
2006
Head Normal Form Bisimulation for Pairs and the λμ-Calculus (Extended Abstract)
B¨ ohm tree equivalence up to possibly infinite η expansion for the pure λ-calculus can be characterized as a bisimulation… 
Highly Cited
2004
Highly Cited
2004
Single-Walled Carbon Nanotube AFM Probes: Optimal Imaging Resolution of Nanoclusters and Biomolecules in Ambient and Fluid Environments
Carbon nanotubes are potentially ideal atomic force microscopy (AFM) probes due to their well-defined geometry, robust mechanical… 
Highly Cited
2000
Highly Cited
2000
Denotational proof languages
This dissertation introduces denotational proof languages (DPLs). DPLs can be used to express and check (validate) formal proofs… 
Highly Cited
1994
Highly Cited
1994
A CPS-Translation of the Lambda-µ-Calculus
We present a translation of Parigot's λμ-calculus [10] into the usual λ-calculus. This translation, which is based on the so… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)