Seminar

The DIAPASoN seminar is currently held every two weeks, usually on Friday at 2pm. It is a mix of internal and external presentations revolving around DIAPASoN topics. To attend the seminar with us and be updated about the forthcoming sessions, or if you wish to give a presentation to the DIAPASoN seminars, you are warmly welcome to subscribe to the seminar mailing list or to write to Davide Barbarossa in charge of the organisation.

2023

  • 09/06: Giulhem Jaber (Nantes Université) - Fully abstract trace semantics for parametric polymorphism via operational game semantics
  • 26/05: Francesco Gavazzo (Università di Pisa) - Operational λ-Calculus in Modern Dresses: Or, First Steps in Relational Reduction Semantics
  • 05/05: Gabriele Vanoni (INRIA Sophia-Antipolis) - Higher-Order and Non-Linear Bayesian Networks
  • Diapason-spring-workshop-2023
  • 03/03: Kostia Chardonnet (Università di Bologna) - Geometry of Interaction & The Notion of Quantum Control Flow
  • 07/02: Ken Sakayori (Università di Bologna) - Operational game semantics for a concurrent language with stores
  • 26/01: Alexis Ghyselen (Università di Bologna) - Higher-Order Model Checking and Algebraic Effects

2022

  • 06/12: Andrea Colledan (Università di Bologna) - A refinement type-and-effect system for quantum circuit description languages
  • 17/11: Davide Barbarossa (Università di Bologna) -  Is there some hidden geometry in (some) denotational models of computation?
  • 03/11: Ugo dal Lago (Università di Bologna) - On Separation Logic and Computational Independence
  • 20/10: Melissa Antonelli (Università di Bologna) - Some (Informal) Remarks on Counting Propositional Logic

2021

  • 16/12: Simone Tini (Università dell'Insubria, Varese)
  • 02/12: Marco Gaboardi (Boston University, Boston)
  • 25/11: Shin-ya Katsumata (National Institute of Informatics, Tokyo)
  • 28/10: Justin Hsu (Cornell University, Ithaca) - A Separation Logic for Probabilistic Independence
  • 22/07:  Carol Mak (Oxford University) - Nonparametric Hamiltonian Monte Carlo ;
     Dominik Wagner (Oxford University) - Densities of Almost Surely Terminating Probabilistic Programs are Differentiable Almost Everywhere
  • 17/06: Prakash Panangaden (McGill University) - Improved representations via sampling-based state similarity for Markov decision processes
  • 10/06: Alexis Ghyselen (ENS Lyon) - Sized Types for Complexity of Parallel Computation in Pi-Calculus
  • 03/06:  Maurizio Murgia (Università di Trento) - Asynchronous Timed Session Types
  • 22/04: Margherita Zorzi (Università di Verona) - Host-Core Programming Theory: foundations
  • 15/04: Hugo Paquet (Oxford University) - Memoization in probabilistic models of linear logic and game semantics
  • 11/03: Andrea Colledan (Univ. Bologna) - Abstract Machine Semantics for Quipper
  • 04/03 : Francesco Dagnino (Università di Genova) - On Quantitative Equality in Graded Doctrines
  • 04/02 : Marie Kerjean (LIPN, Université Paris 13) - ∂ is for Dialectica: Typing Differentiable Programming
  • 14/01 : Giulio Guerrieri (University of Bath) - Categorifying Non-Idempotent Intersection Types
  • 07/01 : Sabine Bauer (TUM Munich) -  A Tree Constraint Solver for Complexity Analysis of Object-oriented Programs

 

2020

  • 17/12 : Davide Barbarossa (LIPN, Université Paris 13) - The resource lambda-mu-calculus, with  some applications