International audienceWe propose the first sound and complete bisimilarities for the call-by-name and call-by-value untyped λµ-calculus, defined in the applicative style. We give equivalence examples to illustrate how our relations can be used; in particular, we prove David and Py's counter-example, which cannot be proved with Lassen's preexisting normal form bisimilarities for the λµ-calculus
International audienceWe study the problem of characterizing contextual equivalence in higher-order ...
International audienceNormal form bisimulation, also known as open bisimulation, is a coinductive te...
AbstractBoth for interleaving and for non-interleaving semantics, several variants of a π-calculus b...
AbstractWe propose the first sound and complete bisimilarities for the call-by-name and call-by-valu...
We propose the first sound and complete bisimilarities for the call-by-name and call-by-value untype...
Normal form bisimilarities are a natural form of program equivalence resting on open terms, first in...
International audienceNormal-form bisimilarity is a simple, easy-to-use behavioral equivalence that ...
International audienceWe present a sound and complete bisimilarity for an untyped $λ-calculus$ with ...
International audienceWe study Abramsky's applicative bisimilarity abstractly , in the context of ca...
International audienceProbabilistic applicative bisimulation is a recently introduced coinductive me...
International audienceWe study how applicative bisimilarity behaves when instantiated on a call-by-v...
We study Milner's encoding of the call-by-value -calculus into the π-calculus. We show that, by tuni...
Ariola et al defined a call-by-need λ-calculus with control, together with a sequent calculus presen...
International audienceIn this paper, we introduce the $λ μ ^{∧∨}$ - call-by-value calculus and we gi...
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus...
International audienceWe study the problem of characterizing contextual equivalence in higher-order ...
International audienceNormal form bisimulation, also known as open bisimulation, is a coinductive te...
AbstractBoth for interleaving and for non-interleaving semantics, several variants of a π-calculus b...
AbstractWe propose the first sound and complete bisimilarities for the call-by-name and call-by-valu...
We propose the first sound and complete bisimilarities for the call-by-name and call-by-value untype...
Normal form bisimilarities are a natural form of program equivalence resting on open terms, first in...
International audienceNormal-form bisimilarity is a simple, easy-to-use behavioral equivalence that ...
International audienceWe present a sound and complete bisimilarity for an untyped $λ-calculus$ with ...
International audienceWe study Abramsky's applicative bisimilarity abstractly , in the context of ca...
International audienceProbabilistic applicative bisimulation is a recently introduced coinductive me...
International audienceWe study how applicative bisimilarity behaves when instantiated on a call-by-v...
We study Milner's encoding of the call-by-value -calculus into the π-calculus. We show that, by tuni...
Ariola et al defined a call-by-need λ-calculus with control, together with a sequent calculus presen...
International audienceIn this paper, we introduce the $λ μ ^{∧∨}$ - call-by-value calculus and we gi...
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus...
International audienceWe study the problem of characterizing contextual equivalence in higher-order ...
International audienceNormal form bisimulation, also known as open bisimulation, is a coinductive te...
AbstractBoth for interleaving and for non-interleaving semantics, several variants of a π-calculus b...