Lambda-mu calculus
In mathematical logic and computer science, the lambda-mu calculus is an extension of the lambda calculus introduced by Michel Parigot. It introduces two new operators: the μ operator (which is completely different both from the μ operator found in computability theory and from the μ operator of modal μ-calculus) and the bracket operator. Proof-theoretically, it provides a well-behaved formulation of classical natural deduction. One of the main goals of this extended calculus is to be able to describe expressions corresponding to theorems in classical logic.
According to the Curry–Howard isomorphism, lambda calculus on its own can express theorems in intuitionistic logic only, and several classical logical theorems can't be written at all. However with these new operators one is able to write terms that have, for example, the type of Peirce's law. According to de Groote, the μ operator corresponds to Felleisen's undelimited control operator C and bracket corresponds to calling a captured continuation.
Wikipedia contributors, "Lambda-mu calculus", Wikipedia, revision 1358536882, retrieved 20 November 2026, source, CC BY-SA 4.0.