[Paper Review] Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method (Long Version)

Ugo Dal Lago, Francesco Gavazzo+1 more|arXiv (Cornell University)|Apr 15, 2017

Logic, programming, and type systems24 references3 citations

TL;DR

This paper presents an abstract framework for applicative bisimilarity in call-by-value $λ$-calculi with algebraic effects, using monads and relators to generalize the notion and prove congruence via Howe's method. The key contribution is identifying minimal axioms on monads and relators that ensure applicative similarity is a precongruence, thereby guaranteeing soundness of bisimilarity for program equivalence across diverse effectful calculi.

ABSTRACT

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 operational semantics. We then show how the theory of relators provides precisely what is needed to generalise applicative bisimilarity to such a calculus, and to single out those monads and relators for which applicative bisimilarity is a congruence, thus a sound methodology for program equivalence. This is done by studying Howe's method in the abstract.

Motivation & Objective

• To provide a unified, abstract account of applicative bisimilarity for higher-order, effectful $λ$-calculi, addressing the lack of generic coinductive techniques in this domain.
• To identify minimal conditions on monads and relators that ensure applicative similarity is a precongruence, thus making bisimilarity sound for contextual equivalence.
• To generalize Howe's method to effectful settings, explaining why congruence proofs vary in complexity across different effects (e.g., probabilistic vs. nondeterministic).
• To demonstrate that the framework applies to concrete effectful calculi, including probabilistic, nondeterministic, and output effects, with a focus on soundness and consistency.
• To lay the groundwork for future work on full abstraction and environmental bisimilarity by identifying the limits and potential of applicative bisimilarity under different monads and relators.

Proposed method

• Formalize a computational $λ$-calculus with algebraic effects using a monadic operational semantics, where effects are modeled via monads.
• Introduce the concept of a relator to lift relations on a set $X$ to relations on $TX$, where $T$ is a monad, enabling relational reasoning over effectful computations.
• Define applicative similarity and bisimilarity in terms of relators, generalizing the standard notion to effectful settings.
• Establish a precongruence result for applicative similarity by verifying a set of mild axioms on monads and relators, ensuring compatibility with all term constructors.
• Apply Howe's method abstractly to prove that the resulting similarity is a precongruence, thereby ensuring that bisimilarity is a sound equivalence for contextual equivalence.
• Verify that the axioms are satisfied by key examples, including the probabilistic, nondeterministic, and output monads, demonstrating broad applicability.

Experimental results

Research questions

• RQ1 What abstract conditions on monads and relators ensure that applicative similarity is a precongruence in effectful $λ$-calculi?
• RQ2 Why do congruence proofs for applicative bisimilarity vary significantly in complexity across different effect types, such as probabilistic vs. nondeterministic effects?
• RQ3 Can a uniform, abstract framework be developed to generalize applicative bisimilarity to arbitrary algebraic effects using monads and relators?
• RQ4 Is applicative bisimilarity sound for contextual equivalence across a wide range of effectful calculi, and under what conditions does it fail?
• RQ5 Can the framework be extended to address full abstraction or environmental bisimilarity, and what constraints are needed for such extensions?

Key findings

• The paper identifies a minimal set of axioms on monads and relators that guarantee applicative similarity is a precongruence, ensuring that bisimilarity is a sound equivalence for contextual equivalence.
• The framework successfully generalizes applicative bisimilarity to effectful $λ$-calculi, including probabilistic, nondeterministic, and output effects, with all examples satisfying the required axioms.
• The authors demonstrate that the standard labeled transition system-based similarity for the output monad is unsound, but a modified definition within their framework yields a sound and congruent notion.
• The proof of congruence via Howe's method is abstracted and unified, explaining the differing logical complexities in prior proofs (e.g., linear programming in probabilistic case vs. simpler logic in nondeterministic case).
• The framework reveals that applicative bisimilarity is fragile in the presence of information-hiding effects like local state or exceptions, confirming known limitations.
• The work provides a foundation for future research on full abstraction and environmental bisimilarity, suggesting that characterizing the class of tests that capture bisimilarity is a promising direction.