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
08
Oct
Regular polygraphs and a homotopical pasting theorem
Clémence Chenavat (Tallinn University of Technology)
A directed complex is a combinatorial object that encodes the data necessary to define a regular polygraph. I will start by presenting Hadzihasanovic's theory of [...]
Événements passés
01
Oct
Unification via the Segal condition internally to the λ-calculus
Vincent Moreau (Tallinn University of Technology)
In this talk, I present ongoing work relating unification, simplicial structures, and higher-order regular languages. My starting point is the fact that Higman's order between [...]
24
Sep
Symmetric monoidal closure without a trace
Pierre Clairambault (CNRS, LIS)
In order to obtain semantics of programming languages with quantitative effects (such as probabilistic or quantum primitives), one common approach is to take a model [...]
16
Juil
09
Juil
Correspondences between codensity and coupling-based liftings, a practical approach.
Samuel Humeau (LIS)
The Kantorovich distance is a widely used metric between probability distributions. The Kantorovich-Rubinstein duality states that it can be defined in two equivalent ways: as [...]
02
Juil
1 = ⊥ in MLL
Olivier Laurent (ÉNS de Lyon)
The introduction of units in multiplicative linear logic (MLL) makes syntactic properties much more complex, in particular regarding the question of identity of proofs and [...]
25
Juin
18
Juin
Sound Operational Game Semantics in Type Theory
Peio Borthelle (Inria, ÉNS de Lyon)
Operational Game Semantics (OGS) is a flexible method for building models for open programs based on their operational semantics. After motivating and giving a high-level [...]
28
Mai
21
Mai
Minimum and Maximum lambda-Terms
Adrienne Lancelot (Università di Bologna)
The study of program preorders leads to more structure than that of program equivalences. Is it actually interesting in the case of the uneffectful lambda-calculus? [...]
07
Mai
Quantitative Diagrammatic Reasoning for Probabilistic Processes
Ralph Sarkis (University College London)
Algebraic structures and equational reasoning are fundamental tools in programming semantics since very early work in the field. The study of probabilistic programs poses several [...]
