International audienceWe introduce the permutative lambda-calculus, an extension of lambda-calculus with three equations and one reduction rule for permuting constructors, generalising many calculi in the literature, in particular Regnier's sigma-equivalence and Moggi's assoc-equivalence. We prove confluence modulo the equations and preservation of beta-strong normalisation (PSN) by means of an auxiliary substitution calculus. The proof of confluence relies on M-developments, a new notion of development for lambda-terms
This thesis deals with the management of explicit resources in functional languages, stressing on pr...
International audienceIn this paper, we present the lambda-mu-and-or-calculus which at the typed lev...
AbstractWe present a proof technique in λ-calculus that can facilitate inductive reasoning on λ-term...
International audienceWe introduce the permutative lambda-calculus, an extension of lambda-calculus ...
International audienceWe introduce the permutative lambda-calculus, an extension of lambda-calculus ...
International audienceInspired by a recent graphical formalism for lambda-calculus based on linear l...
International audienceInspired by a recent graphical formalism for lambda-calculus based on linear l...
International audienceInspired by a recent graphical formalism for lambda-calculus based on linear l...
Inspired by a recent graphical formalism for lambda-calculus based on linearlogic technology, we int...
Inspired by a recent graphical formalism for lambda-calculus based on Linear Logic technology, we in...
International audienceThe lambda-bar-mu-mu-tilde-calculus, defined by Curien and Herbelin, is a vari...
International audienceSince Melliès has shown that lambda-sigma (a calculus of explicit substitution...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
International audienceIn this paper, we present the lambda-mu-and-or-calculus which at the typed lev...
This thesis deals with the management of explicit resources in functional languages, stressing on pr...
International audienceIn this paper, we present the lambda-mu-and-or-calculus which at the typed lev...
AbstractWe present a proof technique in λ-calculus that can facilitate inductive reasoning on λ-term...
International audienceWe introduce the permutative lambda-calculus, an extension of lambda-calculus ...
International audienceWe introduce the permutative lambda-calculus, an extension of lambda-calculus ...
International audienceInspired by a recent graphical formalism for lambda-calculus based on linear l...
International audienceInspired by a recent graphical formalism for lambda-calculus based on linear l...
International audienceInspired by a recent graphical formalism for lambda-calculus based on linear l...
Inspired by a recent graphical formalism for lambda-calculus based on linearlogic technology, we int...
Inspired by a recent graphical formalism for lambda-calculus based on Linear Logic technology, we in...
International audienceThe lambda-bar-mu-mu-tilde-calculus, defined by Curien and Herbelin, is a vari...
International audienceSince Melliès has shown that lambda-sigma (a calculus of explicit substitution...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
International audienceThe lambda_ws-calculus is a lambda-calculus with explicit substitutions that s...
International audienceIn this paper, we present the lambda-mu-and-or-calculus which at the typed lev...
This thesis deals with the management of explicit resources in functional languages, stressing on pr...
International audienceIn this paper, we present the lambda-mu-and-or-calculus which at the typed lev...
AbstractWe present a proof technique in λ-calculus that can facilitate inductive reasoning on λ-term...