Week 1
| CEST time | UTC time | July 5 (Monday) |
July 6 (Tuesday) |
July 7 (Wednesday) |
July 8 (Thursday) |
July 9 (Friday) |
July 10 (Saturday) |
|---|---|---|---|---|---|---|---|
| 9-10h | 7-8h | Automated complexity analysis for term rewriting Carsten Fuhs |
Lambda calculus: the generalized finite development theorem Jean-Jacques Levy |
Inversion and term rewriting systems Maja H. Kirkeby, Robert Glück |
An introduction to deep inference methodology in proof theory Paola Bruscoli |
Lambda calculi with patterns L. Liquori, V. van Oostrom |
|
| 10-11h | 8-9h | ||||||
| 11-12h | 9-10h | ||||||
| 16-17h | 14-15h | Nominal rewriting Maribel Fernandez |
|||||
| 17-18h | 15-16h | ||||||
| 18-19h | 16-17h | ||||||
Week 2
| CEST time | UTC time | July 12 (Monday) |
July 13 (Tuesday) |
July 14 (Wednesday) |
July 15 (Thursday) |
July 16 (Friday) |
|---|---|---|---|---|---|---|
| 16-17h | 14-15h | Compiler construction in Maude Christiano Braga |
Unification and narrowing in Maude 3.0 Santiago Escobar |
From rewriting to matching logic D. Lucanu, X. Chen, G. Rosu |
Session types for message-passing concurrency Jorge A. Perez |
|
| 17-18h | 15-16h | Pathway logic: using rewriting logic to understand how cells work Carolyn Talcott |
||||
| 18-19h | 16-17h | |||||
| 19-20h | 17-18h | |||||