Entangled State Monads Extended abstract

We present a monadic treatment of symmetric state-based bidirectional transformations, and show how it arises naturally from the well-known asymmetric lens-based account. We introduce two presentations of a concept we dub the “entangled” state monad, and prove their equivalence. As a step towards a unifying account of bidirectionality in general, we exhibit existing classes of statebased approaches from the literature as instances of our new constructions. This extended abstract reports on work in progress.

[1]  Gordon D. Plotkin,et al.  Notions of Computation Determine Monads , 2002, FoSSaCS.

[2]  Philip Wadler Monads for Functional Programming , 1995, Advanced Functional Programming.

[3]  Benjamin C. Pierce,et al.  Combinators for bi-directional tree transformations: a linguistic approach to the view update problem , 2005, POPL '05.

[4]  Martin Hofmann,et al.  Symmetric lenses , 2011, POPL '11.

[5]  Eugenio Moggi,et al.  Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[6]  Perdita Stevens,et al.  Bidirectional model transformations in QVT: semantic issues and open questions , 2007, MODELS'07.