Skip to main content

“Bidirectionalization for Free” for Monomorphic Transformations

Matsuda, Kazutaka, Wang, Meng (2014) “Bidirectionalization for Free” for Monomorphic Transformations. Science of Computer Programming, 111 (Part 1). pp. 79-109. ISSN 0167-6423. (doi:10.1016/j.scico.2014.07.008) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) (KAR id:47485)

Language: English

Restricted to Repository staff only
Contact us about this Publication
[thumbnail of scp14.pdf]
Official URL


Abstract 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. In particular, a technique known as bidirectionalization is able to analyze and transform unidirectional programs written in general purpose languages, and “bidirectionalize” them. Among others, an approach termed semantic bidirectionalization proposed by Voigtländer stands out in terms of user-friendliness. A unidirectional program can be written using arbitrary language constructs, as long as the function it represents is polymorphic and the language constructs respect parametricity. The free theorems that follow from the polymorphic type of the program allow a kind of forensic examination of the transformation, determining its effect without examining its implementation. This is convenient, as the programmer is not restricted to using a particular syntax; but it does require the transformation to be polymorphic. In this paper, we lift this polymorphism requirement to improve the applicability of semantic bidirectionalization. Concretely, we provide a type class PackM ? ? ? , which intuitively reads “a concrete datatype ? is abstracted to a type ?, and the ‘observations’ made by a transformation on values of type ? are recorded by a monad ?”. With PackM, we turn monomorphic transformations into polymorphic ones that are ready to be bidirectionalized. We demonstrate our technique with case studies of typical applications of bidirectional transformation, namely text processing, \{XML\} query and graph transformation, which were commonly considered beyond semantic bidirectionalization because of their monomorphic nature.

Item Type: Article
DOI/Identification number: 10.1016/j.scico.2014.07.008
Uncontrolled keywords: Bidirectional transformation, Free theorem, Type class, Haskell
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Meng Wang
Date Deposited: 01 Mar 2015 00:50 UTC
Last Modified: 16 Feb 2021 13:23 UTC
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year