Skip to main content

Applicative Bidirectional Programming with Lenses

Matsuda, Kazutaka, Wang, Meng (2015) Applicative Bidirectional Programming with Lenses. In: ACM SIGPLAN International Conference on Functional Programming, 31 August – 2 September, 2015, Vancouver, British Columbia, Canada. (KAR id:49084)

Language: English
Download (298kB) Preview


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 Voigtlander’s semantic bidirectionalization, creating a new programming style that is able to bag benefits from both.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: Bidirectional Programming, Lens, Bidirectionalization, Free Theorem, Functional Programming, Haskell
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing
Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Meng Wang
Date Deposited: 19 Jun 2015 11:25 UTC
Last Modified: 29 May 2019 14:43 UTC
Resource URI: (The current URI for this page, for reference purposes)
  • Depositors only (login required):


Downloads per month over past year