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
12
Fév
Is typed realizability only predicative?
Félix Castro (I2M, Aix-Marseille)
In Kleene realizability, formulas are interpreted as sets of (untyped) programs. This approach allows for a sound interpretation of Higher-Order Logic (HOL): it leads to [...]
19
Fév
Ohana trees, Taylor expansion and multi-type semantics for the λI-calculus. No variable gets left behind or forgotten!
Rémy Cerda (Università di Bologna)
The standard notion of evaluation trees for the λ-calculus, namely Böhm trees, is quite ill-behaved with respect to the inputs of programs, namely free variables: [...]
Événements passés
The geometry of parallelism: probabilistic and quantum effects
Claudia Faggian (IRIF, PPS team, Université de Paris)
What become the notions of confluence and convergence when a parallel rewrite system has both a probabilistic choice and the possibility of non-termination? We present [...]
Deciding simply-typed equivalence with sums and the empty type
Gabriel Scherer (Parsifal team at INRIA Saclay)
The simply-typed λ-calculus, with only function types, is strongly normalizing, and its program equivalence relation is decidable: unlike in more advanced type system with polymorphism [...]
15
Déc
Remarques sur le développement de Taylor des réseaux
Lorenzo Tortora de Falco (Universita Roma Tre)
A l’occasion de la soutenance de thèse de Matteo Acclavio la veille. http://logica.uniroma3.it/~tortora/
Conflict nets: Locally canonical MALL proof nets
Willem Heijltjes (University of Bath)
A l’occasion de la soutenance de thèse de Matteo Acclavio l’après-midi. Proof nets capture the semantic and/or computational content of linear logic in a clean [...]
The geometry of logic, algebra and computation
Antonino Salibra (DAIS, Universita' Ca'Foscari Venezia)
A l’occasion de la soutenance de thèse de Thomas Leventis l’après-midi; We present a research program relating Logic, Algebra and Computation through decomposition operators, Boolean [...]
Practical Subtyping for System F
Christophe Raffalli (LAMA, Université de Savoie)
We present a rich type system with subtyping for an extension of System F. Our type constructors include sum and product types, universal and existential [...]
Transfinite games and the sequoidal exponential
John Gowers (University of Bath)
Laird a introduit la notion de catégorie sequoïdale – une extension de la structure de catégorie monoïdale par un nouveau connecteur ⊘ (le sequoïde) dont [...]
Effectuses, land of probabilities
Titouan Carette (ENS Lyon)
Curry-Howard isomorphism is a well known game which consists in translating concepts of computer science into logical ones and vice versa. Thus, when physicists came [...]
Aspects of 2-algebras: operads, bimodules and analytic functors
André Joyal (Université du Québec à Montréal (UQAM))
We exploit the analogy between the notion of symmetric monoidal closed category and that of commutative ring. We say that a presentable monoidal closed category [...]
