In this paper, we introduce the $λ μ ^{∧∨}$ - call-by-value calculus and we give a proof of the Church-Rosser property of this system. This proof is an adaptation of that of Andou (2003) which uses an extended parallel reduction method and complete development
We introduce a domain-free λµ-calculus of call-by-value as a short-hand for the second order Church-...
AbstractWe propose the first sound and complete bisimilarities for the call-by-name and call-by-valu...
International audienceAriola et al defined a call-by-need λ-calculi with control, together with a se...
International audienceIn this paper, we introduce the $λ μ ^{∧∨}$ - call-by-value calculus and we gi...
LAMA- Équipe de logique, Université de Savoie, F-73376 Le Bourget du Lac, France In this paper, we i...
International audienceIn this paper, we introduce the $\lambda\mu^{\wedge \vee}$- call-by-value calc...
Contains fulltext : __104055.pdf (publisher's version ) (Open Access)Seventh Annua...
AbstractThis paper proves the confluency and the strong normalizability of the call-by-value λμ-calc...
We give a detailed, informal proof of the Church-Rosser property for the untyped λ-calculus and show...
AbstractThis paper examines the old question of the relationship between ISWIM and the λ-calculus, u...
AbstractThe simplest proofs of the Church Rosser Property are usually done by the syntactic method o...
International audienceAbstract In each variant of the $$\lambda $$ λ -calculus, factorization and no...
AbstractThe notion of parallel reduction is extracted from the Tait-Martin-Löf proof of the Church-R...
AbstractThe notion of parallel reduction is extracted from the simple proof of the Church-Rosser the...
AbstractThis note provides a short elementary proof of the fact that the reduction sequence discover...
We introduce a domain-free λµ-calculus of call-by-value as a short-hand for the second order Church-...
AbstractWe propose the first sound and complete bisimilarities for the call-by-name and call-by-valu...
International audienceAriola et al defined a call-by-need λ-calculi with control, together with a se...
International audienceIn this paper, we introduce the $λ μ ^{∧∨}$ - call-by-value calculus and we gi...
LAMA- Équipe de logique, Université de Savoie, F-73376 Le Bourget du Lac, France In this paper, we i...
International audienceIn this paper, we introduce the $\lambda\mu^{\wedge \vee}$- call-by-value calc...
Contains fulltext : __104055.pdf (publisher's version ) (Open Access)Seventh Annua...
AbstractThis paper proves the confluency and the strong normalizability of the call-by-value λμ-calc...
We give a detailed, informal proof of the Church-Rosser property for the untyped λ-calculus and show...
AbstractThis paper examines the old question of the relationship between ISWIM and the λ-calculus, u...
AbstractThe simplest proofs of the Church Rosser Property are usually done by the syntactic method o...
International audienceAbstract In each variant of the $$\lambda $$ λ -calculus, factorization and no...
AbstractThe notion of parallel reduction is extracted from the Tait-Martin-Löf proof of the Church-R...
AbstractThe notion of parallel reduction is extracted from the simple proof of the Church-Rosser the...
AbstractThis note provides a short elementary proof of the fact that the reduction sequence discover...
We introduce a domain-free λµ-calculus of call-by-value as a short-hand for the second order Church-...
AbstractWe propose the first sound and complete bisimilarities for the call-by-name and call-by-valu...
International audienceAriola et al defined a call-by-need λ-calculi with control, together with a se...
DOI
Add to ORKG