FISP Kick-Off 2016   

November 15, 2016

Session 1 (3W04)
13:00 – 14:00 Welcome
14:00 – 14:45 Federico Aschieri
On Gödel and Dummett Logics: Natural Deduction, Curry-Howard, Parallelism and Witness Extraction
14:45 – 15:30 Kenji Miyamoto
Provably correct (co)recursive programs through extraction
15:30 – 16:00 Coffee Break
Session 2 (3W04)
16:00 – 16:45 David Obwaller
Interaction Automata and the ia2d Interpreter
16:45 – 17:30 Martin Avanzini
Complexity Analysis by Polymorphic Sized Type Inference and Constraint Solving

November 16, 2016

Session 3 (3W03)
09:30 – 10:30 Alessio Guglielmi
Making Several Computation/Normalisation Mechanisms Coexist
10:30 – 11:15 Stéphane Gimenez
Trying to analyze the complexity of strong reductions
11:15 – 12:00 Anela Lolic
Extraction of expansion trees using CERES
12:00 – 14:00 Lunch and Discussion
Session 4 (2S16)
14:00 – 15:00 Roman Kuznets
Interpolation beyond sequent calculi: modal, intuitionistic, and intermediate logics
15:00 – 15:45 Juan P. Aguilera
tbc.
15:45 – 16:15 Coffee Break
Session 5 (2S16)
16:15 – 17:00 Andrea Aler Tubella,
Decomposition and cycles: isolating two complexity-generating mechanisms
17:00 – 17:45 Lutz Straßburger
Proof compression and combinatorial flows

Workshop Dinner
21:00 – 23:00 Schwarzer Adler

November 17, 2016

Session 6 (3W04)
10:00 – 11:00 George Metcalfe
Proof and Order
11:00 – 11:45 Matthias Baaz
Unsound inferences make proofs shorter
11:45 – 14:00 Lunch and Discussion
Session 7 (3W04)
14:00 – 14:45 Sonia Marin
Comparing BOX and ! via polarities
14:45 – 15:30 Georg Moser
The Embedding Lemma Revisited
15:30 – 16:00 Coffee Break and Closing