Coalgebraic aspects of bidirectional computation

Faris Abou-Saleh, James McKinna, Jeremy Gibbons

Research output: Contribution to journalConference articlepeer-review


We have previously (Bx, 2014; MPC, 2015) shown that several statebased bx formalisms can be captured using monadic functional programming, using the state monad together with possibly other monadic effects, giving rise to structures we have called monadic bx (mbx). In this paper, we develop a coalgebraic theory of state-based bx, and relate the resulting coalgebraic structures (cbx) to mbx. We show that cbx support a notion of composition coherent with, but conceptually simpler than, our previous mbx definition. Coalgebraic bisimulation yields a natural notion of behavioural equivalence on cbx, which respects composition, and essentially includes symmetric lens equivalence as a special case. Finally, we speculate on the applications of this coalgebraic perspective to other bx constructions and formalisms.

Original languageEnglish
Pages (from-to)16-30
Number of pages15
JournalCEUR Workshop Proceedings
Publication statusPublished - 6 Jul 2015
Event4th International Workshop on Bidirectional Transformations 2015 - L'Aquila, Italy
Duration: 24 Jul 201524 Jul 2015

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Coalgebraic aspects of bidirectional computation'. Together they form a unique fingerprint.

Cite this