| Time | Event |
|---|---|
| 09:20-09:30 | Welcome |
| 9:30-10:00 | An Algebra for Directed Bigraphs D. Grohmann and M. Miculan |
| 10:00-10:30 | Modeling and Verifying Graph Transformations in Proof Assistants M. Strecker |
| 10:30-11:00 | Coffee Break |
| 11:00-11:30 | Intensional properties of polygraphs G. Bonfante and Y. Guiraud |
| 11:30-12:00 | Term-graph rewriting in TOM with relative positions E. Balland and P. Brauner |
| 12:00-12:30 | Deduction Graphs with Universal Quantification H. Geuvers and I. Loeb |
| 12:30-14:00 | Lunch |
| 14:00-14:30 | Rewritings for Polarized Mutiplicative and Exponential Proof Structures C. Fouquere and V. Mogbil |
| 14:30-15:00 | Hard Combinators D. Bechet and S. Lippi |
| 15:00-15:20 | Universal Boolean Systems D. Bechet and S. Lippi |
| 15:20-15:40 | Interaction Nets with Nested Pattern Matching S. Sato and A. Hussan |
| 15:40-16:00 | Sub-lambda-calculi, classified F-R. Sinot |
| 16:00-16:30 | Coffee |