Abstract
Software frequently converts data from one representation to another and vice versa. Naïvely specifying both conversion directions separately is error prone and introduces conceptual duplication. Instead, bidirectional programming techniques allow programs to be written which can be interpreted in both directions. However, these techniques often employ unfamiliar programming idioms via restricted, specialised combinator libraries. Instead, we introduce a framework for composing bidirectional programs monadically, enabling bidirectional programming with familiar abstractions in functional languages such as Haskell. We demonstrate the generality of our approach applied to parsers/printers, lenses, and generators/predicates. We show how to leverage compositionality and equational reasoning for the verification of round-tripping properties for such monadic bidirectional programs.
Original language | English |
---|---|
Title of host publication | Programming Languages and Systems |
Editors | Luís Caires |
Place of Publication | Cham |
Publisher | Springer International Publishing Switzerland |
Pages | 147-175 |
Number of pages | 29 |
ISBN (Electronic) | 978-3-030-17184-1 |
ISBN (Print) | 978-3-030-17183-4 |
DOIs | |
Publication status | Published - 6 Apr 2019 |
Event | 28th European Symposium on Programming - Prague, Czech Republic Duration: 8 Apr 2019 → 11 Apr 2019 Conference number: 28 https://conf.researchr.org/track/etaps-2019/esop-2019-papers |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer Cham |
Volume | 11423 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Symposium
Symposium | 28th European Symposium on Programming |
---|---|
Abbreviated title | ESOP 2019 |
Country/Territory | Czech Republic |
City | Prague |
Period | 8/04/19 → 11/04/19 |
Internet address |