BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:4908@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20231012T110000
DTEND;TZID=Europe/Paris:20231012T123000
DTSTAMP:20260107T154902Z
URL:https://www.i2m.univ-amu.fr/evenements/from-thin-concurrent-games-to-r
 elational-models/
SUMMARY:Pierre Clairambault (LIS): From Thin Concurrent Games to Relational
  Models
DESCRIPTION:Pierre Clairambault: Denotational models can roughly be classif
 ied in two kinds: static models (domains\, relations\, coherence spaces\, 
 etc)\, which record atemporal final "states" of completed executions\; and
  dynamic models (game semantics\, GoI\, etc)\, which additionally describe
  how such final states are reached with temporal or causal information. Th
 e link between the two seems intuitively simple as it suffices to "forget 
 time". But the question hides surprising conceptual depth and led to an ac
 tive line of research in the 2000s\, with landmark results by Melliès and
  Boudes among others.\nRecently\, there has been renewed interest in vario
 us extensions of relational models\; either quantitative (e.g. the weighte
 d relational model)\, or proof-relevant (e.g. distributors / generalized s
 pecies of structure). In this talk\, I will present recent results examini
 ng this dynamic-to-static question for such generalized relational models\
 ; in particular I will aim to arrive at a recent result obtained together 
 with Olimpieri and Paquet: a cartesian closed pseudofunctor from the carte
 sian closed bicategory of thin concurrent games\, to that of Fiore\, Gambi
 no\, Hyland and Winskel's generalized species of structure.
CATEGORIES:Séminaire,Logique et Interactions
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20230326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR