Modal Reasoning = Metric Reasoning, via Lawvere
Ugo Dal Lago, Francesco Gavazzo

TL;DR
This paper extends coinductive program equivalence to modal settings using a novel generalization of Abramsky's applicative bisimilarity, establishing a congruence and linking modal equivalences with program distances.
Contribution
It introduces a general theory of ternary program relations via comonadic lax extensions and defines a modal applicative bisimilarity, bridging modal equivalences and distances.
Findings
Modal applicative bisimilarity is a congruence.
Modal program equivalences and distances coincide.
Extended bisimilarity applies to coeffectful behaviors.
Abstract
Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent computations where code usage plays a central role. The theory of program equivalence for modal and coeffectful languages, however, is considerably underdeveloped if compared to the denotational and operational semantics of such languages. This raises the question of how much of the theory of ordinary program equivalence can be given in a modal scenario. In this work, we show that coinductive equivalences can be extended to a modal setting, and we do so by generalising Abramsky's applicative bisimilarity to coeffectful behaviours. To achieve this goal, we develop a general theory of ternary program relations based on the novel notion of a comonadic lax extension, on top of which we define a modal extension of Abramsky's applicative bisimilarity (which we dub modal applicative…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
