Applicative Bidirectional Programming with Lenses

Kazutaka Matsuda, Meng Wang

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

9 Citations (Scopus)
6 Downloads (Pure)

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. One way to reduce the development and maintenance effort of bidirectional transformations is to have specialized languages in which the resulting programs are bidirectional by construction---giving rise to the paradigm of bidirectional programming. In this paper, we develop a framework for applicative-style and higher-order bidirectional programming, in which we can write bidirectional transformations as unidirectional programs in standard functional languages, opening up access to the bundle of language features previously only available to conventional unidirectional languages. Our framework essentially bridges two very different approaches of bidirectional programming, namely the lens framework and Voigtländer's semantic bidirectionalization, creating a new programming style that is able to bag benefits from both.
Original languageEnglish
Title of host publicationICFP '15 Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming
PublisherAssociation for Computing Machinery (ACM)
Pages62-74
Number of pages13
ISBN (Print)9781450336697
DOIs
Publication statusPublished - 1 Aug 2015

Structured keywords

  • Programming Languages

Keywords

  • Bidirectional Programming
  • Bidirectionalization
  • Free Theorem
  • Functional Programming
  • Haskell
  • Lens

Cite this