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… 
2013
2013
Today, one of the most important issues of all physicians is assessment of judicial problems after a death. In this case,victim… 
2011
Review
2003
Review
2003
Martin-Löf type theory is a formal and conceptual framework for constructive mathematics where induction and recursion are two… 
2003
2003
Griffin [22] pointed out that, just as the pure λ-calculus corresponds to intuitionistic logic, a λ-calculus with firstclass… 
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…