Séminaire Logique et Interactions
Le séminaire Logique et Interaction est le séminaire de l’équipe LDP de l’I2M. Il est conjoint au séminaire de l’équipe LSC du LIS.
Une liste de diffusion (modérée) pour recevoir les annonces d’exposés : i2m-seminaire-logique@univ-amu.fr
Pour s’inscrire, contacter le responsable.
Les prochains séminaires
16
Jul
Événements passés
14
Dec
07
Dec
Making concurrency functional
Glynn Winskel (Huawei Edinburgh Research Centre and Strathclyde University)
This talk bridges between two major paradigms in computation, the functional, at basis computation from input to output, and the interactive, where computation reacts to [...]
30
Nov
Algebras in Relational Semantics
Guy McCusker (Bath)
The well-known relational semantics of linear logic is constructed out of two kinds of free algebra construction: the powerset and the set of finite multisets [...]
23
Nov
Nominal Algebraic-Coalgebraic Data Types, with Applications to Infinitary λ-Calculi
Rémy Cerda (I2M)
Une improvisation à partir de résultats récents adaptant les travaux de Kurz, Petrişan, Severi et de Vries à des types mixtes algébriques et coalgébriques.
16
Nov
09
Nov
Higher Structures in Homotopy Type Theory
Antoine Allioux (IRIF)
The definition of algebraic structures on arbitrary types in homotopy type theory (HoTT) has proven elusive so far. This is due to types behaving like [...]
02
Nov
Infinitary cut elimination via finite approximations
Matteo Acclavio, Gianluca Curzi (U. of southern Denmark, Gothenburg)
We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor [...]
26
Oct
Graphical Languages for Quantum Computation
Marc de Visme (INRIA Paris-Saclay)
In this talk, we will go through the basics of graphical languages for quantum computation, their advantages and uses, and the two main traditions of [...]
19
Oct
12
Oct
From Thin Concurrent Games to Relational Models
Pierre Clairambault (LIS)
Denotational models can roughly be classified in two kinds: static models (domains, relations, coherence spaces, etc), which record atemporal final "states" of completed executions; and [...]
