‹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

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

16:30 - 18:10
Programming and ApplicationsBx at Baie des Anges B
Chair(s): Kazutaka Matsuda Tohoku University
16:30
30m
Talk
An Axiomatic Basis for Bidirectional Programming
Bx
Hsiang-Shang ‘Josh’ Ko National Institute of Informatics, Japan, Zhenjiang Hu National Institute of Informatics
Link to publication DOI
17:00
30m
Talk
Profunctor Optics and the Yoneda Lemma
Bx
Jeremy Gibbons Department of Computer Science, University of Oxford, Guillaume Boisseau
17:30
30m
Talk
Towards sound, flexible and optimal build for megamodels
Bx
Perdita Stevens University of Edinburgh
18:00
10m
Day closing
Closing
Bx