Programme

Semaine Lun. 19 Mar. 20 Mer. 21 Jeu. 22 Ven. 23 Liste

	Lun. 19	Mar. 20	Mer. 21	Jeu. 22	Ven. 23
08:00 09:00 10:00 11:00 12:00 13:00 14:00 15:00 16:00 17:00 18:00 19:00 20:00 21:00 22:00 23:00	Accueil 8:45 - 9:00 (15min) Accueil Denis Kuperberg, Guilhem Jaber, Luigi Santocanale & Alexis Saurin Back to basics 9:00 - 10:30 (1h30) Back to basics D Kuperberg, L Santocanale, A Saurin Pause café 10:30 - 10:50 (20min) Pause café Basics of category theory, algebras and coalgebras 10:50 - 12:20 (1h30) Basics of category theory, algebras and coalgebras F Jafarrahmani & D Petrisan Déjeuner 12:20 - 14:00 (1h40) Déjeuner The μ-calculus and its proof-theory 14:00 - 15:15 (1h15) The μ-calculus and its proof-theory Bahareh Afshari Automata on infinite structures 15:15 - 16:15 (1h) Automata on infinite structures Karoliina Lehtinen Pause café 16:15 - 16:45 (30min) Pause café Bisimulation and coinductive types in the Rocq proof assistant 16:45 - 18:15 (1h30) Bisimulation and coinductive types in the Rocq proof assistant Damien Pous & Yannick Zakowski Dîner 19:30 - 20:45 (1h15) Dîner	Basics of category theory, algebras and coalgebras 8:50 - 10:30 (1h40) Basics of category theory, algebras and coalgebras Farzad Jafarrahmani & Daniela Petrisan Pause café 10:30 - 10:50 (20min) Pause café The μ-calculus and its proof-theory 10:50 - 12:20 (1h30) The μ-calculus and its proof-theory Bahareh Ashari Déjeuner 12:20 - 14:00 (1h40) Déjeuner Automata on infinite structures 14:00 - 15:00 (1h) Automata on infinite structures Karoliina Lehtinen Bisimulation and coinductive types in the Rocq proof assistant 15:00 - 16:15 (1h15) Bisimulation and coinductive types in the Rocq proof assistant Damien Pous & Yannick Zakowski Pause café 16:15 - 16:45 (30min) Pause café Higher-order languages, Categories and Automata 16:45 - 18:00 (1h15) Higher-order languages, Categories and Automata Paul-André Melliès & Daniela Petrisan Dîner 19:30 - 20:45 (1h15) Dîner	Software Verification via Fixed-Point Logics: Constraint Solving, Cyclic-Proof Search, and Strategy Synthesis 8:50 - 10:30 (1h40) Software Verification via Fixed-Point Logics: Constraint Solving, Cyclic-Proof Search, and Strategy Synthesis Hiroshi Unno Pause café 10:30 - 10:50 (20min) Pause café Higher-order languages, Categories and Automata 10:50 - 12:20 (1h30) Higher-order languages, Categories and Automata Paul-André Mellies & Daniela Petrisan Déjeuner 12:20 - 13:30 (1h10) Déjeuner Après-midi libre 13:30 - 18:00 (4h30) Après-midi libre Randonnée organisée ou après-midi libre Banquet 19:30 - 21:00 (1h30) Banquet Cocktail 21:00 - 23:00 (2h) Cocktail	Guarded recursive types 8:50 - 11:00 (2h10) Guarded recursive types Daniel Gratzer & Adrien Guatto Pause café 11:00 - 11:20 (20min) Pause café Software Verification via Fixed-Point Logics: Constraint Solving, Cyclic-Proof Search, and Strategy Synthesis 11:20 - 12:20 (1h) Software Verification via Fixed-Point Logics: Constraint Solving, Cyclic-Proof Search, and Strategy Synthesis Hiroshi Unno Déjeuner 12:20 - 14:00 (1h40) Déjeuner Bisimulation and coinductive types in the Rocq proof assistant 14:00 - 15:15 (1h15) Bisimulation and coinductive types in the Rocq proof assistant Damien Pous & Yannick Zakowski Circular and non wellfounded proofs: expressiveness and semantics 15:15 - 16:15 (1h) Circular and non wellfounded proofs: expressiveness and semantics Anupam Das & Farzad Jafarrahmani Pause café 16:15 - 16:45 (30min) Pause café Circular and non wellfounded proofs: expressiveness and semantics 16:45 - 18:15 (1h30) Circular and non wellfounded proofs: expressiveness and semantics Anupam Das & Farzad Jafarrahmani Dîner 19:30 - 20:45 (1h15) Dîner	Guarded recursive types 8:50 - 10:50 (2h) Guarded recursive types Daniel Gratzer & Adrien Guatto Pause café 10:50 - 11:20 (30min) Pause café Conclusion et Problèmes ouverts 11:20 - 12:20 (1h) Conclusion et Problèmes ouverts Déjeuner 12:20 - 14:00 (1h40) Déjeuner Discussions libres 14:00 - 17:00 (3h) Discussions libres

Flux RSS | Vie privée | Accessibilité