Denotational semantics explores the meaning of proofs and programs as morphisms acting on abstract mathematical spaces. The first models were based on domains (partially ordered sets) such as Scott domains, dI-domains, coherence spaces etc. and continuous or stable morphisms; recent developments in this area have led to sophisticated accounts of sequentiality (strong stability, bi-stable morphisms).
Game models interpret proofs/programs as strategies in games, providing an operationally more informative interpretation of proofs, with remarkable mathematical achievements (full completeness theorems, interpretation of statefull programming languages, a new approach to the type isomorphisms problem, etc., and also the related theory of ludics, an interactive viewpoint on logic).
New models interpret proofs as continuous linear functions on vector spaces, with possible connections to quantum programming, and operational interpretations of the Taylor formula. This workshop will be an opportunity of confrontation between these various lines of reseach, in this very active field.