International audienceWe present a sound and complete bisimilarity for an untyped $λ-calculus$ with higher-order local references. Our relation compares values by applying them to a fresh variable, like normal-form bisimilarity, and it uses environments to account for the evolving store. We achieve completeness by a careful treatment of evaluation contexts comprising open stuck terms. This work improves over Støvring and Lassen's incomplete environment-based normal-form bisimilarity for the $λρ-calculus$, and confirms, in relatively elementary terms, Jaber and Tabareau's result , that the state construct is discriminative enough to be characterized with a bisimilarity without any quantification over testing arguments
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculus...
International audienceBehavioral theory for higher-order process calculi is less well developed than...
AbstractBoth for interleaving and for non-interleaving semantics, several variants of a π-calculus b...
International audienceWe present a sound and complete bisimilarity for an untyped $λ-calculus$ with ...
International audienceNormal-form bisimilarity is a simple, easy-to-use behavioral equivalence that ...
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus...
Abstract. A region calculus is a programming language calculus with explicit instrumentation for mem...
AbstractWe propose the first sound and complete bisimilarities for the call-by-name and call-by-valu...
International audienceNormal form bisimulation, also known as open bisimulation, is a coinductive te...
International audienceWe propose the first sound and complete bisimilarities for the call-by-name an...
Normal form bisimilarities are a natural form of program equivalence resting on open terms, first in...
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging ...
AbstractWe study the problem of characterizing contextual equivalence in higher-order languages with...
AbstractExploiting linear type structure, we introduce a new theory of weak bisimilarity for the π-c...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculu...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculus...
International audienceBehavioral theory for higher-order process calculi is less well developed than...
AbstractBoth for interleaving and for non-interleaving semantics, several variants of a π-calculus b...
International audienceWe present a sound and complete bisimilarity for an untyped $λ-calculus$ with ...
International audienceNormal-form bisimilarity is a simple, easy-to-use behavioral equivalence that ...
This paper describes two new bisimulation equivalences for the pure untyped call-by-value λ-calculus...
Abstract. A region calculus is a programming language calculus with explicit instrumentation for mem...
AbstractWe propose the first sound and complete bisimilarities for the call-by-name and call-by-valu...
International audienceNormal form bisimulation, also known as open bisimulation, is a coinductive te...
International audienceWe propose the first sound and complete bisimilarities for the call-by-name an...
Normal form bisimilarities are a natural form of program equivalence resting on open terms, first in...
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging ...
AbstractWe study the problem of characterizing contextual equivalence in higher-order languages with...
AbstractExploiting linear type structure, we introduce a new theory of weak bisimilarity for the π-c...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculu...
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculus...
International audienceBehavioral theory for higher-order process calculi is less well developed than...
AbstractBoth for interleaving and for non-interleaving semantics, several variants of a π-calculus b...