Semantic bidirectionalization revisited
Paper in proceedings, 2014

A bidirectional transformation is a pair of mappings between source and view data objects, one in each direction. When the view is modified, the source is updated accordingly with respect to some laws. Over the years, a lot of effort has been made to offer better language support for programming such transformations, essentially allowing the programmers to construct one mapping of the pair and have the other automatically generated. As an alternative to creating specialized new languages, one can try to analyse and transform programs written in general purpose languages, and ``bidirectionalize" them. Among others, a technique termed as semantic bidirectionalization stands out in term of user-friendliness. The unidirectional program can be written using arbitrary language constructs, as long as the function is polymorphic and the language constructs respect parametricity. The free theorem that follows from the polymorphic type of the program allows a kind of forensic examination of the transformation, determining its effect without examining its implementation. This is convenient, in the sense that the programmer is not restricted to using a particular syntax; but it does require the transformation to be polymorphic. In this paper, we revisit the idea of semantic bidirectionalization and reveal the elegant principles behind the current state-of-the-art techniques. Guided by the findings, we derive much simpler implementations that scale easily.

Haskell

Bidirectional Transformation

Free Theorem

View-Update Problem

Author

Meng Wang

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Shayan Najd Javadipour

Chalmers, Computer Science and Engineering (Chalmers), Software Technology (Chalmers)

Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

51-61

Areas of Advance

Information and Communication Technology

Subject Categories

Computer Science

DOI

10.1145/2543728.2543729

ISBN

978-1-4503-2619-3

More information

Created

10/7/2017