AbstractWhen sharing is studied in the λ-calculus, some sub-calculi often pop up, for instance λI or the linear λ-calculus. In this paper, we generalise these to a large class of sub-calculi, parametrised by an arbitrary predicate on the number of occurrences of bound variables. Such a definition only makes sense when the sub-calculi are stable by β-reduction. Surprisingly, we are able to give a complete description and classification of such stable sub-calculi, in a rather algebraic way; and surprisingly again, we discover some unexpected such subcalculi. This could lead to a better understanding of the structure of the λ-calculus
A sequent calculus with the subformula property has long been recognised as a highly favourable star...
AbstractThe notion of parallel reduction is extracted from the Tait-Martin-Löf proof of the Church-R...
Abstract. Most of the logics commonly used in verification, such as LTL, CTL, CTL∗, and PDL can be ...
Subtyping can be fairly complex for union types, due to interactions with other types, such as funct...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
AbstractThe ρ-calculus generalises term rewriting and the λ-calculus by defining abstractions on arb...
An explicit sharing lambda calculus is presented in which duplication of subterms proceeds on indivi...
Abstract. We present a uniform framework for defining different λ-typed λ-calculi in terms of system...
AbstractWe present a simple extension of typed λ-calculus where functions can be overloaded by putti...
AbstractOne source of complexity in the μ-calculus is its ability to specify an unbounded number of ...
λν is an extension of the λ-calculus which internalises the calculus of substitutions. In the curren...
Extending the λ-calculus with either explicit substitution or generalised reduction has been the sub...
AbstractWe study the encoding of λ[], the call-by-name λ-calculus enriched with McCarthy's amb opera...
International audienceWe study the behavioural theory of πP, a π-calculus in the tradition of Fusion...
AbstractThe statementS⩽Tin aλ-calculus with subtyping is traditionally interpreted by a semantic coe...
A sequent calculus with the subformula property has long been recognised as a highly favourable star...
AbstractThe notion of parallel reduction is extracted from the Tait-Martin-Löf proof of the Church-R...
Abstract. Most of the logics commonly used in verification, such as LTL, CTL, CTL∗, and PDL can be ...
Subtyping can be fairly complex for union types, due to interactions with other types, such as funct...
Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether ...
AbstractThe ρ-calculus generalises term rewriting and the λ-calculus by defining abstractions on arb...
An explicit sharing lambda calculus is presented in which duplication of subterms proceeds on indivi...
Abstract. We present a uniform framework for defining different λ-typed λ-calculi in terms of system...
AbstractWe present a simple extension of typed λ-calculus where functions can be overloaded by putti...
AbstractOne source of complexity in the μ-calculus is its ability to specify an unbounded number of ...
λν is an extension of the λ-calculus which internalises the calculus of substitutions. In the curren...
Extending the λ-calculus with either explicit substitution or generalised reduction has been the sub...
AbstractWe study the encoding of λ[], the call-by-name λ-calculus enriched with McCarthy's amb opera...
International audienceWe study the behavioural theory of πP, a π-calculus in the tradition of Fusion...
AbstractThe statementS⩽Tin aλ-calculus with subtyping is traditionally interpreted by a semantic coe...
A sequent calculus with the subformula property has long been recognised as a highly favourable star...
AbstractThe notion of parallel reduction is extracted from the Tait-Martin-Löf proof of the Church-R...
Abstract. Most of the logics commonly used in verification, such as LTL, CTL, CTL∗, and PDL can be ...