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:8895@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20251106T100000
DTEND;TZID=Europe/Paris:20251106T130000
DTSTAMP:20251103T140738Z
URL:https://www.i2m.univ-amu.fr/evenements/a-small-step-towards-an-open-so
 urce-logic-investigating-models-of-computation-for-linear-realisability/
SUMMARY:Valentin Maestracci (I2M): A small step towards an Open Source Logi
 c\, Investigating models of computation for Linear Realisability
DESCRIPTION:Valentin Maestracci: Jury\n\nPaul-André MELLIES -- Rapporteur\
 nDirecteur de Recherche\nUniversité Paris-Cité/CNRS\n\nShin-Ya KATSUMATA
  -- Rapporteur\nFull time Professor\nKyoto Sangyo University\n\nSamuel MIM
 RAM -- Président du jury\nProfesseur des Universités\nÉcole Polytechniq
 ue\n\nAurore ALCOLEI -- Examinatrice\nMaitresse de conférences\nUniversit
 é Paris-Est Créteil Val de Marne (UPEC)\n\nMasahito HASEGAWA -- Examinat
 eur\nFull Time Professor\nKyoto University\n\nClaudia FAGGIAN -- Examinatr
 ice\nChargée de Recherche\nUniversité Paris-Cité/CNRS\n\nLaurent REGNIE
 R -- Directeur de thèse\nProfesseur des Université\nAix Marseille Univer
 sité\n\nThomas SEILLER -- co-Directeur de thèse\nChargé de Recherche\nU
 niversité Paris 13/CNRS\n\nAbstract of the Manuscript\n\nThis thesis stud
 ies computational models used for realizability for linear logic (as part 
 of Geometry of Interaction):\n- A first chapter explains the history of th
 e field\, presenting several computational models existing in the literatu
 re as well as their connection to linear logic.\n- A second chapter studie
 s in detail a specific computational model: Seiller's interaction graphs. 
 We define a generalization of this model\, we show that it is an instance 
 of a new\, "low-level" framework to define abstract computational model\, 
 in which we prove the key property of associativity of execution. This mak
 es it possible to automatically prove this property\, and thus to define a
  computational model for any instance of the framework. We study another i
 nstance of the framework solving a problem that existed in a generalizatio
 n of interaction graphs (thick graphs). Finally\, we explain why the model
  of flows is too general to be an instance of the framework.\n- A third ch
 apter focuses on an "intermediate" model: the star model\, defined in Eng'
 s thesis\, which generalizes flows in a combinatorial sense\, but remains 
 somehow similar to the framework defined previously. We study a new versio
 n of this model\, correcting and refining essential definitions and proper
 ties\, some of which\, although present in Eng's thesis\, were problematic
 .\n- The final\, highly exploratory chapter\, attempts to better understan
 d certain combinatorial and geometric properties of the interaction graph 
 model\, drawing inspiration from several areas of mathematics (cobordism\,
  directed spaces\, category theory...). We also defend the idea that "stat
 ic locations" are similar to gluing and to the notion of "open system".
CATEGORIES:Soutenance de thèse,AGLR
LOCATION:I2M Luminy - TPR2\, Amphithéâtre Herbrand 130-134 (1er étage)\,
  163 Avenue de Luminy\, Marseille\, 13009\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=163 Avenue de Luminy\, Mars
 eille\, 13009\, France;X-APPLE-RADIUS=100;X-TITLE=I2M Luminy - TPR2\, Amph
 ithéâtre Herbrand 130-134 (1er étage):geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20251026T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR