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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A cornerstone of theoretical computer science is the Curry-Howard correspondence where formulas are types, proofs are programs… 
2014
2014
Recently there has been a lot of interest in such bounds. In [FKM, Section 1.4], Theorem 2’ (with an unspecified dependence on f… 
2011
2006
2006
Epidemiological research indicates that drug abuse is prevalent among individuals infected with HIV-1. Evidence from preclinical… 
2003
2003
As soon as alpha-interferon (IFN) became available it was used in chronic HBeAg negative chronic hepatitis B: at the beginning… 
2001
2001
Parigot suggested symmetric structural reduction rules for application to µ-abstraction in [9]to ensure unique representation of… 
1998
1998
There is an intimate connection between proofs of the natural deduction systems and typed lambda calculus. It is well-known that… 
1994
1994
We present a connuent rewrite system which extents a previous calculus of explicit substitutions for the lambda-calculus HaLe89…