Time | Speaker | Title |
10.00 - 10.30 | Arrival and coffee |
10.30 - 11.00 | Juan Carlos Saenz Carrasco | Towards a general algorithm for path-finding problems |
11.00 - 11.30 | Graham Hutton | Work It, Wrap It, Fix It, Fold It |
11.30 - 12.00 | Florent Balestrieri | Everything You Always Wanted to Know About GADTs* (*But Were Afraid to Ask) |
12.00 - 13.30 | Lunch |
13.30 - 14.00 | Bas van Gijzel | Towards a framework for the implementation and verification of translations between argumentation models |
14.00 - 14.30 | Jennifer L. P. Hackett | The Under Performing Unfold |
14.30 - 15.00 | Patrick Bahr | Deriving Modular Recursion Schemes from Tree Transducers |
15.00 - 15.30 | Thorsten Altenkirch | From High-School to University-Algebra |
15.30 - 16.00 | Coffee break |
16.00 - 16.30 | Nuo Li | An implementation of Syntactic weak Infinity Groupoids |
16.30 - 17.00 | Glyn Faulkner | A slow road to fast code: sequencing optimisation passes using Monte-Carlo tree search |
17.00 - 17.30 | Ambrus Kaposi | Semisimplicial types |
19.00 - | Dinner |