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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We introduce an intersection type system for the λμ-calculus that is invariant under subject reduction and expansion. The system… (More)
Is this relevant?
2013
2013
  • P E T E R S E L I N G
  • 2013
We give a categorical semantics to the call-by-name and call-by-value versions of Parigot’s λμ-calculus with disjunction types… (More)
Is this relevant?
2012
2012
This paper proposes new mathematical models of the untyped L ambda-mu calculus. One is called the stream model, which is an… (More)
Is this relevant?
2011
2011
Starting with the idea of reflexive objects in Selinger’s control categories, we define three different denotational models of… (More)
Is this relevant?
2002
2002
We show that a certain simple call-by-name continuation semantics of Parigot’s λμ-calculus is complete. More precisely, for every… (More)
Is this relevant?
2002
2002
We show that anyλ-model gives rise to aλμ-model, in the sense that if we have M =λμ N in the equational theory of type free… (More)
Is this relevant?
2001
2001
Parigot [12] suggested symmetric structural reduction rules to ensure unique representation of data types. We prove strong… (More)
  • figure 2
Is this relevant?
2001
2001
We give a categorical semantics to the call-by-name and call -by-value versions of Parigot’s -calculus with disjunction types. We… (More)
  • table 1
  • table 2
  • table 6
  • table 10
  • table 11
Is this relevant?
1994
1994
We present a connuent rewrite system which extents a previous calculus of explicit substitutions for the lambda-calculus HaLe89… (More)
Is this relevant?
1994
1994
We present a connuent rewrite system which e x t e n ts a previous calculus of explicit substitutions for the lambda-calculus… (More)
Is this relevant?