Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method

• Published in: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
• Main Authors: Dal Lago, Ugo, Gavazzo, Francesco, Blain Levy, Paul
• Other Authors: Alma Mater Studiorum Università di Bologna = University of Bologna (UNIBO), Foundations of Component-based Ubiquitous Systems (FOCUS), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), School of Computer Science Birmingham, University of Birmingham Birmingham, ANR-16-CE25-0011,REPAS,Des systèmes logiciels fiables et conscients des données privées, via les métriques de bisimulation(2016)
• Format: Conference Object
• Language: English
• Published: HAL CCSD 2017
• Subjects: ACM: D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.1: Formal Definitions and Theory/D.3.1.0: Semantics; [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]; [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]; Iceland
• Online Access: https://inria.hal.science/hal-01636365; https://inria.hal.science/hal-01636365v1/document; https://inria.hal.science/hal-01636365v1/file/lics2017HAL.pdf; https://doi.org/10.1109/LICS.2017.8005117

International audience 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.