Workshop Program


DICE 2018

Saturday 14 April 2018, Erato

08:30 – 09:00 Welcome
09:00 – 10:00 Anupam Das: Monotonicity in logic and complexity (invited talk)
10:00 – 10:30 Coffee Break
10:30 – 11:15 Łukasz Czajka: Term rewriting characterisation of LOGSPACE for finite and infinite data (abstract)
11:15 – 12:00 Michael Schaper: Automated resource analysis with paicc (abstract)
12:00 – 14:30 Lunch Break
14:30 – 15:15 Lê Thành Dũng Nguyễn: On the complexity of finding cycles in proof nets (abstract)
15:15 – 16:00 Florian Steinberg and Eike Neumann: Parametrised second-order complexity theory with applications to the study of interval computation (abstract)
16:00 – 16:30 Coffee Break
16:30 – 17:15 Beniamino Accattoli, Andrea Condoluci and Claudio Sacerdoti Coen: Sharing equality is linear (abstract)
17:15 – 18:00 Miguel Couceiro, Erkko Lehtonen, Pierre Mercuriali, Romain Péchoux and Mathias Soeken: Normal form systems generated by single connectives have mutually equivalent efficiency (abstract)
18:00 – 18:30 Business Meeting


Sunday 15 April 2018, Erato

09:00 – 10:00 Jan Hoffmann: Resource analysis for probabilistic programs (invited talk)
10:00 – 10:30 Coffee Break
10:30 – 11:15 Beniamino Accattoli, Delia Kesner and Stéphane Graham-Lengrand: Multi types, evaluation lengths, and normal forms (abstract)
11:15 – 12:00 Patrick Baillot and Alexis Ghyselen: Combining linear logic and size types for implicit complexity (abstract)
12:00 – 14:30 Lunch
14:30 – 15:15 Martin Avanzini, Ugo Dal Lago and Akihisa Yamada: The interpretation method for probabilistic systems (abstract)
15:15 – 16:00 Ugo Dal Lago and Alexis Ghyselen: On linear dependent types and probabilistic termination (abstract)
16:00 – 16:30 Coffee Break
16:30 – 17:15 Luc Pellissier and Thomas Seiller: Entropy and complexity lower bounds (abstract)
17:15 – 18:00 Damiano Mazza: A functorial approach to reductions among decision problems (abstract)