Write a Blog >>
ICFP 2018
Sun 23 - Sat 29 September 2018 St. Louis, Missouri, United States
Tue 25 Sep 2018 15:00 - 15:22 at Stifel Theatre - Bidirectional Programming Chair(s): Wouter Swierstra

Profunctor optics are a neat and composable representation of bidirectional data accessors, including lenses, and their dual, prisms. The profunctor representation exploits higher-order functions and higher-kinded type constructor classes, but the relationship between this and the familiar representation in terms of “getter” and “setter” functions is not at all obvious. We derive the profunctor representation from the concrete representation, making the relationship clear. It turns out to be a fairly direct application of the Yoneda Lemma, arguably the most important result in category theory. We hope this derivation aids understanding of the profunctor representation. Conversely, it might also serve to provide some insight into the Yoneda Lemma.

Tue 25 Sep

icfp-2018-papers
15:00 - 16:30: Research Papers - Bidirectional Programming at Stifel Theatre
Chair(s): Wouter SwierstraUtrecht University, Netherlands
icfp-2018-papers15:00 - 15:22
Talk
Guillaume BoisseauUniversity of Oxford, Jeremy GibbonsDepartment of Computer Science, University of Oxford
DOI
icfp-2018-papers15:22 - 15:45
Talk
Rudi HornUniversity of Edinburgh, Roly PereraUniversity of Glasgow, James CheneyUniversity of Edinburgh, UK
DOI
icfp-2018-papers15:45 - 16:07
Talk
Solomon MainaUniversity of Pennsylvania, Anders MiltnerPrinceton University, Kathleen FisherTufts University, USA, Benjamin C. PierceUniversity of Pennsylvania, Dave WalkerPrinceton University, Steve ZdancewicUniversity of Pennsylvania
DOI
icfp-2018-papers16:07 - 16:30
Talk
Csongor KissImperial College London, Matthew PickeringUniversity of Bristol, Nicolas WuUniversity of Bristol, UK
DOI