‹Programming› 2018
Mon 9 - Thu 12 April 2018 Nice, France
Tue 10 Apr 2018 17:00 - 17:30 at Baie des Anges B - Programming and Applications Chair(s): Kazutaka Matsuda

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. The relationship between this and the familiar representation in terms of “getter” and “setter” functions is not at all obvious. We derive of the former from the latter, 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 for BXers into the Yoneda Lemma. The key observation is due to Bartosz Milewski, but not published anywhere.

Tue 10 Apr
Times are displayed in time zone: (GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

16:30 - 18:10: Bx 2018 - Programming and Applications at Baie des Anges B
Chair(s): Kazutaka MatsudaTohoku University
bx-2018-papers16:30 - 17:00
Hsiang-Shang ‘Josh’ KoNational Institute of Informatics, Japan, Zhenjiang HuNational Institute of Informatics
Link to publication DOI
bx-2018-papers17:00 - 17:30
Jeremy GibbonsDepartment of Computer Science, University of Oxford, Guillaume Boisseau
bx-2018-papers17:30 - 18:00
Perdita StevensUniversity of Edinburgh
bx-2018-papers18:00 - 18:10
Day closing