Notions of Bidirectional Computation and Entangled State Monads

Faris Abou-Saleh, James Cheney, Jeremy Gibbons, James McKinna, Perdita Stevens

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Bidirectional transformations (bx) support principled consistency maintenance between data sources. Each data source corresponds to one perspective on a composite system, manifested by operations to 'get' and 'set' a view of the whole from that particular perspective. Bx are important in a wide range of settings, including databases, interactive applications, and model-driven development. We show that bx are naturally modelled in terms of mutable state; in particular, the 'set' operations are stateful functions. This leads naturally to considering bx that exploit other computational effects too, such as I/O, nondeterminism, and failure, all largely ignored in the bx literature to date. We present a semantic foundation for symmetric bidirectional transformations with effects. We build on the mature theory of monadic encapsulation of effects in functional programming, develop the equational theory and important combinators for effectful bx, and provide a prototype implementation in Haskell along with several illustrative examples.
Original languageEnglish
Title of host publicationMathematics of Program Construction
Subtitle of host publication12th International Conference, MPC 2015, Königswinter, Germany, June 29--July 1, 2015. Proceedings
PublisherSpringer
Pages187-214
Number of pages28
ISBN (Electronic)978-3-319-19797-5
ISBN (Print)978-3-319-19796-8
DOIs
Publication statusPublished - 2015

Publication series

NameLecture Notes in Computer Science
Volume9129
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint Dive into the research topics of 'Notions of Bidirectional Computation and Entangled State Monads'. Together they form a unique fingerprint.

Cite this