Bidirectionalization for free with runtime recording: Or, a light-weight approach to the view-update problem

Kazutaka Matsuda, Meng Wang

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

7 Citations (Scopus)

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, a technique termed as semantic bidirectionalization proposed by Voigtländer 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 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, 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 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 a case study of standard XML queries, which were considered beyond semantic bidirectionalization because of their monomorphic nature.

Original languageEnglish
Title of host publicationProceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP 2013
Pages297-308
Number of pages12
DOIs
Publication statusPublished - 2013 Oct 15
Externally publishedYes
Event15th Symposium on Principles and Practice of Declarative Programming, PPDP 2013 - Madrid, Spain
Duration: 2013 Sep 162013 Sep 18

Publication series

NameProceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP 2013

Other

Other15th Symposium on Principles and Practice of Declarative Programming, PPDP 2013
CountrySpain
CityMadrid
Period13/9/1613/9/18

Keywords

  • Haskell
  • XML transformation
  • bidirectional transformation
  • free theorem
  • type class

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Bidirectionalization for free with runtime recording: Or, a light-weight approach to the view-update problem'. Together they form a unique fingerprint.

  • Cite this

    Matsuda, K., & Wang, M. (2013). Bidirectionalization for free with runtime recording: Or, a light-weight approach to the view-update problem. In Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP 2013 (pp. 297-308). (Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP 2013). https://doi.org/10.1145/2505879.2505888