We study Abramsky's applicative bisimilarity abstractly, in the context of call-by-value λ-
calculi with algebraic effects. We first of all endow a computational λ-calculus with a monadic …

We introduce a categorical framework for operational semantics, in which we define
substitution-closed bisimilarity, an abstract analogue of the open extension of Abramsky's …

This paper studies quantitative refinements of Abramsky's applicative similarity and
bisimilarity in the context of a generalisation of Fuzz, a call-by-value λ-calculus with a linear …

We study the encoding of λ [], the call-by-name λ-calculus enriched with McCarthy's amb
operator, into the π-calculus. Semantically, amb is a challenging operator, for the fairness …

We 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 …

Bisimilarity (also known as' applicative bisimulation') has attracted a good deal of attention
as an operational equivalence for λ-calculi. It approximates or even equals Morris-style …

Bohm tree equivalence up to possibly infinite eta expansion for the pure lambda-calculus
can be characterized as a bisimulation equivalence. We call this co-inductive syntactic …

Normal form bisimulation, also known as open bisimulation, is a coinductive technique for
higher-order program equivalence in which programs are compared by looking at their …

We give the first sound and complete proof method for observational equivalence in full
polymorphic λ-calculus with existential types and first-class, higher-order references. Our …

Higher-order abstract GSOS is a recent extension of Turi and Plotkin's framework of
Mathematical Operational Semantics to higher-order languages. The fundamental well …