{"id":202,"date":"2018-03-07T15:01:24","date_gmt":"2018-03-07T14:01:24","guid":{"rendered":"http:\/\/vm-web-qualif.pun.ens-lyon.fr\/lip-plume\/?page_id=202"},"modified":"2026-10-12T12:32:50","modified_gmt":"2026-10-12T10:32:50","slug":"202-2","status":"publish","type":"page","link":"https:\/\/www.ens-lyon.fr\/LIP\/PLUME\/202-2\/","title":{"rendered":"Groupe de travail"},"content":{"rendered":"\n
\n
\n

Unless otherwise stated, talks are held on Mondays<\/strong> at 1:30pm<\/strong> in room 315<\/strong> on the 3rd floor of the M7<\/strong> building. Contact\u00a0Amina Doumane (amina.doumane@ens-lyon.fr) or Valeria Vignudelli (valeria.vignudelli@ens-lyon.fr) to organise a talk.<\/p>\n

Upcoming talks<\/h2>\n
    \n
  • 12\/10\/2026 : Iwan Quemerais<\/strong>. Operational game semantics for concurrent languages and pi-calculus<\/li>\n<\/ul>\n

    Previous talks<\/h2>\n

    2026\/27<\/p>\n

      \n
    • 5\/10\/2026 : s\u00e9minaires ANR ATQUA<\/strong><\/li>\n<\/ul>\n

      2025\/26<\/p>\n

        \n
      • 29\/06\/2026 : Badis Idiri<\/strong>. Cyclic proofs and bi-automata<\/li>\n
      • 22\/06\/2026 : Lynda Bentoucha<\/strong>. On equivalence of proofs in MLL- and its formalization in Rocq<\/li>\n
      • 15\/06\/2026 : Olivier Laurent<\/strong>. What if true = false?<\/li>\n
      • 30\/03\/2026 : Yoann Dabrowski<\/em><\/strong>. Constructive continuous logics as quantitative extensions of linear logic<\/li>\n
      • 23\/03\/2026 : Rocq Band<\/strong>.<\/li>\n
      • 16\/03\/2026 : Guido Fiorillo<\/strong>. On higher-order probabilistic verification via the weighted relational model of linear logic<\/li>\n
      • 2\/03\/2026 : Davide Barbarossa<\/strong>. Tropical geometry of probabilistic programming languages<\/li>\n
      • 23\/02\/2026 : Rocq Band<\/strong>.<\/li>\n
      • 26\/01\/2026 : Olivier Laurent<\/strong>. Building subtyping relations inside the Lambek calculus<\/li>\n
      • 19\/01\/2026 : Damien Pous<\/strong>. Using string diagrams to do nice proofs, in Rocq<\/li>\n
      • 5\/01\/2026 : Samuel Arsac<\/strong>. Adhesive category theory for graph rewriting in Rocq<\/li>\n
      • 15\/12\/2026 : Rocq Band<\/strong>.<\/li>\n
      • 8\/12\/2025 : Colin Riba<\/strong>. Toward refinement types for temporal properties in Scott domains<\/li>\n
      • 1\/12\/2025 : Samuel Arsac<\/strong>. An introduction to category theory<\/li>\n
      • 24\/11\/2025 :\n
          \n
        • Antonio Casares<\/strong><\/em>. An automata model for Borel-MSO<\/li>\n
        • \n
          Vaishnavi Sundararajan<\/strong><\/em>. Logical explorations for security theory<\/div>\n<\/li>\n<\/ul>\n<\/li>\n
        • 17\/11\/2025 : Adrienne Lancelot<\/strong><\/em>. Interaction equivalence and improvement<\/li>\n
        • 4\/11\/2025 :\n
            \n
          • Ivan Proki\u0107.<\/strong> <\/em>Asynchronous multiparty session types for correct orchestration of federated learning<\/li>\n
          • Dragi\u0161a \u017duni\u0107<\/strong><\/em>. Understanding the computation at the core of a centralized exchange<\/li>\n<\/ul>\n<\/li>\n
          • 23\/10\/2025\u00a0: Miko\u0142aj Boja\u0144czyk<\/strong><\/em>. Functions computed by Alice and Bob<\/li>\n
          • 13\/10\/2025 : Jui-Hsuan Wu<\/strong>. Positive sharing and abstract machines<\/li>\n
          • 6\/10\/2025 : Damien Pous<\/strong>.\u00a0Well-founded unions, constructively?<\/li>\n
          • 29\/09\/2025 : Matteo Mio<\/strong>.\u00a0A practical introduction to Zero Knowledge proofs<\/li>\n
          • 22\/09\/2025 : Olivier Laurent<\/strong>. General structural rules, cut elimination and expressive power, part II<\/li>\n
          • 15\/09\/2025 : Olivier Laurent<\/strong>. General structural rules, cut elimination and expressive power, part I<\/li>\n<\/ul>\n

            2024\/25<\/p>\n

              \n
            • 30\/06\/2025 : Josselin Poiret<\/strong><\/em>. Sort polymorphism in Rocq<\/li>\n
            • 23\/06\/2025 : Denis Kuperberg<\/strong>. Bisimulation-invariant MSO over finite transition systems<\/li>\n
            • 5\/06\/2025 : Paul Brunet<\/strong><\/em>. Representations<\/li>\n
            • 2\/06\/2025 : Lukas Mulder<\/strong><\/em>. Functoriality of enriched data types<\/li>\n
            • 3\/02\/2025 : Samuel Humeau<\/strong>. Correspondences between codensity and coupling-based liftings, a practical approach<\/li>\n
            • 20\/01\/2025 : Samuel Arsac<\/strong>. Formalising adhesive category theory in Rocq<\/li>\n
            • 9\/12\/2024 : Mario Rom\u00e1n<\/strong><\/em>. Partial Markov categories<\/li>\n
            • 2\/12\/2024 : Elena di Lavore<\/strong><\/em>. Coalgebraic causal processes<\/li>\n
            • 18\/11\/2024 : Antonio Casares<\/strong><\/em>. Canonical models in automata theory<\/li>\n
            • 7\/10\/2024 : Giulia Giusti<\/strong>. JAX Autodiff from a linear logic perspective<\/li>\n
            • 24\/09\/2024 : Willem<\/em> Heijltjes<\/em><\/strong>. The functional machine calculus<\/li>\n
            • 2\/09\/2024 : Rory Lucyshyn-Wright<\/strong><\/em>. V-graded functor categories, bifunctors, and structures in bigraded categories<\/li>\n<\/ul>\n

              2023\/24<\/p>\n

                \n
              • 1\/07\/2024 : Am\u00e9lie Rima<\/strong>. Vers une notion de preuves canonique pour le syst\u00e8me F<\/li>\n
              • 24\/06\/2024 : R\u00e9mi Di Guardia<\/strong>. Autour du th\u00e9or\u00e8me de Yeo<\/li>\n
              • 10\/06\/2024 : Samuel Arsac<\/strong>. The Raft consensus algorithm<\/li>\n
              • 3\/06\/2024 : Nguy\u1ec5n L\u00ea Th\u00e0nh D\u0169ng<\/strong>. <\/span>Computing the polynomial degree of size-to-height increase for macro\u00a0tree transducers<\/li>\n
              • 27\/05\/2024 : Samuel Humeau<\/strong>. A finite presentation of graphs of treewidth at most three<\/li>\n
              • 8\/04\/2024 : Corentin Barloy<\/strong><\/em>. Circuit complexity of regular languages<\/li>\n
              • 22\/01\/2024 : Ralph Sarkis<\/strong>. Generalized_Metric_Spaces_Final_v3 (1)_Finla_DONE (2)<\/li>\n
              • 15\/01\/2024 : J\u00e9r\u00e9mie Marqu\u00e8s<\/strong><\/em>. A duality between theories of linear orders and a class of profinite monoids<\/li>\n
              • 11\/12\/2023 : Denis Kuperberg<\/strong>. SMT Solving and modelling for biology<\/li>\n
              • 4\/12\/2023 : Paolo Pistone<\/strong>. Tropical mathematics and the lambda calculus<\/li>\n
              • 13\/11\/2023 : Nathan Lhote<\/strong><\/em>. Minimization of Cost Register Automata over a field<\/li>\n
              • 6\/11\/2023 : Cyril Cohen<\/strong><\/em>. Unsolvability of the Quintic formalized in dependent type theory<\/li>\n
              • 9\/10\/2023 : <\/span>Samuel Arsac<\/strong>. Verification using the Conditional Contextual Refinement framework<\/span><\/li>\n
              • 5\/10\/2023 : <\/span>Paolo Torrini<\/strong><\/em>. Support for enriched categories in Hierarchy Builder<\/span><\/li>\n
              • 2\/10\/2023 :\u00a0Nguy\u1ec5n L\u00ea Th\u00e0nh D\u0169ng<\/strong>. Algebraic recognition of regular functions<\/span><\/li>\n
              • 25\/09\/2023 : <\/span>Michele Pagani<\/strong>. The variable elimination algorithm as a let-term rewriting<\/span><\/li>\n
              • 18\/09\/2023 : Cyril Cohen<\/strong><\/em>. Hierarchy Builder, a language and tool for designing and maintaining algebraic hierarchies<\/li>\n<\/ul>\n

                2022\/23<\/p>\n

                  \n
                • 10\/07\/2023 :\n
                    \n
                  • Galaad Langlois<\/strong>. (Co)datatypes in Coq via W-types and M-types in the category of setoids<\/li>\n
                  • Pierre Goutagny<\/strong>.\u00a0Kleene algebra with hypotheses: modular formalisation<\/li>\n<\/ul>\n<\/li>\n
                  • 19\/06\/2023 : Dakotah Lambert<\/strong><\/em>. Algebraic perspectives on words and their parts<\/li>\n
                  • 22\/05\/2023 :\u00a0Nguy\u1ec5n L\u00ea Th\u00e0nh D\u0169ng<\/strong>.\u00a0Unique\u00a0perfect\u00a0matchings\u00a0and\u00a0proof\u00a0nets<\/span><\/li>\n
                  • 15\/05\/2023 : R\u00e9mi Di Guardia<\/strong>. A simple proof of sequentialization for MLL proof nets<\/li>\n
                  • 24\/04\/2023 : Sam van Gool<\/strong><\/em>.\u00a0Modal unification and graph homomorphisms<\/li>\n
                  • 20\/03\/2023 : <\/span>Nguy\u1ec5n L\u00ea Th\u00e0nh D\u0169ng<\/strong>.\u00a0<\/span>A complexity gap between pomset logic and system BV<\/li>\n
                  • 13\/03\/2023 : Nguy\u1ec5n L\u00ea Th\u00e0nh D\u0169ng<\/strong>. Polyregular functions: some recent developments<\/li>\n
                  • 6\/03\/2023 : <\/span>Ralph Sarkis<\/strong>.\u00a0Universal relational algebra (with string diagrams)<\/span><\/span><\/span><\/li>\n
                  • 27\/02\/2023 : <\/span>Wesley Fussner<\/strong><\/em>.<\/span> Interpolation in semilinear logics<\/span><\/li>\n
                  • 20\/02\/2023 : Pawe\u0142 Parys<\/strong><\/em>. The probabilistic\u00a0Rabin tree theorem<\/span><\/li>\n
                  • 30\/01\/2023 : Ralph Sarkis<\/strong>. Diagrammatic reasoning for the category\u00a0Rel<\/strong><\/li>\n
                  • 23\/01\/2023 : Olivier Idir<\/strong>. Automates explorables : expressivit\u00e9 et d\u00e9cidabilit\u00e9<\/li>\n
                  • 12\/12\/2022 : Ambroise Lafont<\/strong><\/em>. Generic pattern unification: a categorical approach<\/li>\n
                  • 5\/12\/2022 : Alexandre Goy<\/strong>. Weakening distributive laws using string diagrams<\/li>\n
                  • 28\/11\/2022 : Colin Riba<\/strong>. Locally finitely presentable arboreal adjunctions<\/li>\n
                  • 21\/11\/2022 : Damiano Mazza<\/strong><\/em>.\u00a0A categorical approach to descriptive complexity theory<\/span><\/li>\n
                  • 7\/11\/2022 :\u00a0R\u00e9mi Di Guardia<\/strong>. Type isomorphisms for Multiplicative-Additive Linear Logic, part II<\/li>\n
                  • 24\/10\/2022 : Nguy\u1ec5n L\u00ea Th\u00e0nh D\u0169ng<\/strong>. Aperiodicity in a non-commutative logic, part II<\/li>\n
                  • 17\/10\/2022 : Nguy\u1ec5n L\u00ea Th\u00e0nh D\u0169ng<\/strong>. Aperiodicity in a non-commutative logic<\/li>\n
                  • 10\/10\/2022 : R\u00e9mi Di Guardia<\/strong>. Type isomorphisms for Multiplicative-Additive Linear Logic<\/li>\n
                  • 3\/10\/2022 : Alexandre Fernandez<\/strong>. Synchronous and non-deterministic spatial computations with global transformations<\/li>\n
                  • 26\/09\/2022 : Damien Pous<\/strong>. Reductions for Kleene algebra with top<\/li>\n<\/ul>\n

                    2021\/22<\/p>\n

                      \n
                    • 27\/06\/2022 : \u00c9mile Hazard<\/strong>. Explorable automata: let’s play with some tokens!<\/li>\n
                    • 23\/05\/2022 : Ralph Sarkis<\/strong>. Quantitative algebraic reasoning : Our recent breakthrough and the bigger picture<\/li>\n
                    • 13\/12\/2021 : <\/span>Kenji Maillard<\/strong><\/em>.<\/span> Models of CIC for gradual dependent types [visio]<\/span><\/li>\n
                    • 06\/12\/2021 : <\/span>Pierre Lescanne<\/strong>.<\/span> Almost all classical propositions are intuitionistic — Zaionc paradox revisited<\/span><\/li>\n
                    • 30\/11\/2021 : Leo Exibard<\/strong><\/em>. Reactive synthesis over infinite data domains with machines with registers<\/li>\n
                    • 29\/11\/2021 : <\/span>Leo Stefanesco<\/strong><\/em>. An asynchronous soundness theorem for concurrent separation logic<\/span><\/li>\n
                    • 22\/11\/2021 : <\/span>Pierre Ohlmann<\/strong><\/em>. Positionalit\u00e9 pour un joueur dans les jeux \u00e0 dur\u00e9e infinie<\/span><\/li>\n
                    • 15\/11\/2021 : Tom Hirschowitz<\/strong><\/em>. Initial-algebra semantics with inductive auxiliary operations [visio]<\/li>\n
                    • 8\/11\/2021 : Alexandre Goy<\/strong>. A journey from alternation to non-determinism on the back of distributive laws<\/li>\n
                    • 25\/10\/2021 : Christophe Lucas<\/strong>. Free modal Riesz spaces are Archimedean: a syntactic proof<\/li>\n
                    • 18\/10\/2021 : <\/span>Ambroise Lafont<\/strong><\/em>. Variable binding and substitution for (nameless) dummies<\/span><\/li>\n
                    • 11\/10\/2021 : Th\u00e9o Winterhalter<\/strong><\/em>. Metacoq and rewrite rules, formally verified meta-theory<\/li>\n
                    • 4\/10\/2021 : Ralph Sarkis<\/strong>. Quotienting a monad via projective algebras<\/li>\n<\/ul>\n

                      2020\/21 [visio]<\/p>\n

                        \n
                      • 7\/06\/2021 : Luca Reggio<\/strong><\/em>. Arboreal categories: an axiomatic theory of resources<\/li>\n
                      • 31\/05\/2021 : Lison Blondeau-Patissier<\/strong>. Positional injectivity for innocent strategies<\/li>\n
                      • 10\/05\/2021 : \u00c9tienne Miquey<\/strong>. Evidenced frames: a unifying framework broadening realizability models<\/li>\n
                      • 12\/04\/2021 : Ralph Sarkis<\/strong>. Combining nondeterminism, probability, and termination: equational and metric reasoning<\/li>\n
                      • 22\/03\/2021 : Christophe Lucas<\/strong>. Proof theory of modal Riesz spaces<\/li>\n
                      • 8\/03\/2021 : Pierre Pradic<\/strong><\/em>. Implicit automata in \u03bb-calculi<\/li>\n
                      • 15\/02\/2021 : Davide Barbarossa<\/strong><\/em>.\u00a0Qualitative Taylor expansion for lambda-mu-calculus with some applications<\/li>\n
                      • 8\/02\/2021 : Alexis Ghyselen<\/strong>. Types for parallel complexity of pi-calculus processes<\/li>\n
                      • 25\/01\/2021 : Rapha\u00eblle Crubill\u00e9<\/strong><\/em>. On higher-order cryptography<\/li>\n
                      • 14\/12\/2020 : Denis Kuperberg<\/strong>. Positive first-order logic on words<\/li>\n<\/ul>\n

                        2019\/20<\/p>\n

                          \n
                        • 24\/02\/2020 : Emile Hazard<\/strong>. Proof systems for the inclusion of languages of infinite words<\/li>\n
                        • 10\/02\/2020 : Udi Boker<\/strong><\/em>. Why these automata types?<\/li>\n
                        • 3\/02\/2020 : Micha\u0142 Skrzypczak<\/strong><\/em>. Computing measures of weak-MSO definable sets of trees<\/li>\n
                        • 27\/01\/2020 : Alexis Ghyselen<\/strong>. Causal complexity in pi-calculus<\/li>\n
                        • 16\/12\/2019 : Luca Reggio<\/strong><\/em>. Duality and limits of finite structures<\/li>\n
                        • 3\/12\/2019 : Alex Simpson<\/strong><\/em>. Sheaf-theoretic principles for reasoning about independence<\/li>\n
                        • 4\/11\/2019 : Colin Riba<\/strong>. Temporal refinements for guarded recursive types<\/li>\n
                        • 21\/10\/2019 : Karoliina Lehtinen<\/strong><\/em>. Quasi-polynomial techniques for parity games and other problems<\/li>\n
                        • 7\/10\/2019 : Damien Pous<\/strong>. A certificate-based approach to formally verified approximations<\/li>\n
                        • 30\/09\/2019 : Alexis Ghyselen<\/strong>. Parallel complexity with types in a process calculus<\/li>\n
                        • 23\/09\/2019 : Olivier Laurent<\/strong>. Phase semantics for cut elimination<\/li>\n
                        • 2\/09\/2019 : Christian Doczkal<\/strong>. Graph theory in Coq: minors, treewidth and isomorphisms<\/li>\n<\/ul>\n

                          Archive (01\/2014–06\/2019)<\/h2>\n

                          2018\/19<\/p>\n

                            \n
                          • 24\/06\/2019 : Quentin Peyras<\/strong><\/em>. Propri\u00e9t\u00e9 du domaine born\u00e9 pour un fragment pratique de la logique lin\u00e9aire temporelle du premier ordre<\/li>\n
                          • 17\/06\/2019 : Jan Martens<\/strong>. Resynchronizability of one-way transducers is undecidable<\/li>\n
                          • 20\/05\/2019 : <\/span>Pierre Lescanne<\/strong>. A lambda calculus with explicit duplication, explicit erasure and implicit names<\/span><\/li>\n
                          • 2\/05\/2019 : <\/span>Paul-Elliott Angles d’Auriac<\/strong><\/em>. Arithmetic transfinite recursion and the Axiom of Choice<\/span><\/li>\n
                          • 25\/04\/2019 : <\/span>Filippo Bonchi<\/strong><\/em>. Graphical conjunctive queries<\/span><\/li>\n
                          • 15\/04\/2019 : <\/span>Valeria Vignudelli<\/strong>. The theory of traces for systems with nondeterminism and probability<\/span><\/li>\n
                          • 8\/04\/2019 : Lorenzo Tortora de Falco<\/strong><\/em>. On some uses of connectedness in linear logic<\/span><\/li>\n
                          • 1\/04\/2019 : Eugenia Oshurko<\/strong>.\u00a0Knowledge representation and update in hierarchies of graphs<\/li>\n
                          • 28\/03\/2019 : Olivier Carton<\/strong><\/em>. Normal numbers with constraints<\/li>\n
                          • 25\/03\/2019 : <\/span>Henning Basold<\/strong>. Recursive proofs for the mu-calculus – with and without probabilities<\/span><\/li>\n
                          • 18\/03\/2019 : Pierre Pradic<\/strong>. A Dialectica-like interpretation of a linear MSO on infinite words<\/li>\n
                          • 11\/03\/2019 : Tom Hirschowitz<\/strong><\/em>. Simple game semantics and Day convolution<\/li>\n
                          • 4\/03\/2019 : Laureline Pinault<\/strong>. Extension of LKA with structural rules<\/li>\n
                          • 11\/02\/2019 : Denis Kuperberg<\/strong>. Bouncing threads for infinitary and circular proofs<\/li>\n
                          • 4\/02\/2019 : Olivier Laurent<\/strong>. Formalizing quantifiers<\/li>\n
                          • 28\/01\/2019 : Pierre Pradic<\/strong>.\u00a0Non-constructiveness of the Cantor-Bernstein theorem<\/li>\n
                          • 6\/12\/2018 : Alexis Ghyselen<\/strong>. Type-based complexity analysis of probabilistic functional programs<\/li>\n
                          • 29\/11\/2018 :\u00a0Fabian Reiter<\/strong><\/em>. Descriptive distributed complexity<\/li>\n
                          • 22\/11\/2018 : Matteo Mio & Christophe Lucas<\/strong>. A hyper-sequent calculus for a probabilistic modal logic<\/li>\n
                          • 8\/11\/2018 :\u00a0Peio Borthelle<\/strong><\/em>.\u00a0Ornaments and induction-recursion<\/li>\n
                          • 25\/10\/2018 : Marc de Visme<\/strong>.\u00a0Quantum game semantics<\/li>\n
                          • 11\/10\/2018 : Pierre Clairambault<\/strong>.\u00a0Linearity in higher-order recursion schemes<\/li>\n
                          • 27\/09\/2018 : Marc Bagnol<\/strong>.\u00a0B\u00fcchi Good-for-Games automata are recognizable in PTime<\/li>\n
                          • 24\/09\/2018 :\u00a0Mahsa Shirmohammadi<\/strong><\/em>.\u00a0On rationality of non-negative matrix factorization<\/li>\n<\/ul>\n

                            2017\/18<\/p>\n

                              \n
                            • 3\/07\/2018 : Marc de Visme<\/strong>.\u00a0A definable game semantics for the linear quantum lambda-calculus<\/li>\n
                            • 2\/07\/2018 : Aurore Alcolei.<\/strong> Resource-tracking concurrent games<\/li>\n
                            • 25\/06\/2018 : Valeria Vignudelli<\/strong>. Proof techniques for program equivalence in probabilistic
                              higher-order languages<\/li>\n
                            • 18\/06\/2018 : Stefania Dumbrava.<\/strong><\/em>\u00a0Certified graph view maintenance with regular\u00a0Datalog<\/li>\n
                            • 7\/06\/2018 : Andrzej\u00a0Murawski.<\/strong><\/em> Higher-order linearisability<\/li>\n
                            • 14\/05\/2018 : Adrien Durier.<\/b> Open call-by-value and the pi-calculus<\/li>\n
                            • 24\/04\/2018 : Gabriel Scherer<\/strong><\/em>.\u00a0Tout r\u00e9ussir en r\u00e9p\u00e9tant beaucoup<\/li>\n
                            • 23\/04\/2018 : Laure Daviaud<\/em>.<\/b> When is containment decidable for probabilistic automata?<\/li>\n
                            • 9\/04\/2018 : Marc de Visme.<\/b> Quantum Game Semantics<\/li>\n
                            • 26\/03\/2018 : Simon Iosti<\/em>.<\/b>\u00a0The synthesis of eventually safe properties via Good-for-Games automata<\/li>\n
                            • 19\/03\/2018 : Christian Doczkal.<\/b>\u00a0A formal proof of the graph minor theorem for treewidth 2<\/li>\n
                            • 5\/03\/2018: Valia Mitsou<\/strong><\/em>.<\/strong> Limitations of treewidth for problems beyond NP<\/li>\n
                            • 26\/02\/2018 : Damien Pous.<\/b>\u00a0Non-well-founded proof theory for IMALL with lists<\/li>\n
                            • 12\/02\/2018 : Pierre Pradic.<\/b>\u00a0A Curry-Howard approach to Church’s synthesis via linear logic<\/li>\n
                            • 5\/02\/2018 : Henning Basold.<\/b>\u00a0Breaking the loop: recursive proofs for coinductive predicates in fibrations<\/li>\n
                            • 18\/12\/2017 : Filippo Bonchi<\/em>.\u00a0<\/b>Sound up-to techniques and complete abstract domain<\/li>\n
                            • 11\/12\/2017 : Sergue\u00ef Lenglet<\/em><\/b>.<\/strong>\u00a0Fully abstract encodings of lambda-calculus\u00a0in HO-core through abstract machines<\/li>\n
                            • 4\/12\/2017 : Guilhem Jaber.<\/b>\u00a0A trace semantics for System F parametric polymorphism<\/li>\n
                            • 27\/11\/2017 : Luc Pellissier.<\/b>\u00a0PhD defense rehearsal<\/li>\n
                            • 16\/10\/2017 : Henning Basold.<\/b>\u00a0A recursive logic for the equivalence of inductive-coinductive programs<\/li>\n
                            • 9\/10\/2017 : Henryk Michalewski<\/em><\/b>.<\/b>\u00a0 AlphaMath<\/li>\n
                            • 2\/10\/2017 : Amina Doumane.<\/b>\u00a0 Constructive completeness for the linear-time mu-calculus<\/li>\n
                            • 26\/09\/2017 : Olivier Laurent.<\/b>\u00a0Double-negations and focusing<\/li>\n
                            • 21\/09\/2017 : Jim Laird<\/strong><\/em>.\u00a0Extensional and intensional semantics of bounded and unbounded nondeterminism<\/li>\n<\/ul>\n

                              2016\/17<\/p>\n

                                \n
                              • 3\/07\/2017 : Simon Castellan.<\/b>\u00a0PhD defense rehearsal<\/li>\n
                              • 15\/06\/2017 : Vincent Michielini, Eugenia Oshurko & Laureline Pinault.<\/strong> M2 defence rehearsals<\/li>\n
                              • 29\/05\/2017 :\u00a0Enric Cosme Ll\u00f3pez.\u00a0<\/b>On recognizability of graphs of bounded treewidth<\/li>\n
                              • 22\/05\/2017 : Anupam Das.<\/b>\u00a0From focused systems to complexity bounds<\/li>\n
                              • 18\/04\/2017 : Alessio Guglielmi<\/strong><\/em>. Decoupling normalization mechanisms with an eye towards concurrency<\/li>\n
                              • 10\/04\/2017 : Aurore Alcolei.<\/b>\u00a0A compositional proof of Herband’s Theorem through game semantics<\/li>\n
                              • 3\/04\/2017 : Anupam Das.<\/b>\u00a0Monotonicity in logic and complexity<\/li>\n
                              • 27\/03\/2017 : Olivier Laurent<\/b>\u00a0Linear logic, double-negation translations and expressiveness<\/li>\n
                              • 6\/03\/2017: Matteo Mio.<\/b>\u00a0An introduction to the duality theory of Boolean algebras with operators<\/li>\n
                              • 13\/02\/2017 : Pierre Pradic.<\/b>\u00a0Devising a realizability notion for Church’s synthesis<\/li>\n
                              • 6\/02\/2017 :\u00a0 Simon Castellan.<\/b>\u00a0Non-angelic concurrent game semantics<\/li>\n
                              • 2\/02\/2017 : Alexandre Miquel<\/strong><\/em>.\u00a0Implicative algebras: a new foundation for realizabity and forcing<\/li>\n
                              • 30\/01\/2017 : Valeria Vignudelli.<\/b>\u00a0Environmental bisimulations for probabilistic higher-order languages<\/li>\n
                              • 16\/01\/2017 : Chung-Kil Hur.\u00a0<\/i><\/b>A promising semantics for relaxed-memory concurrency<\/li>\n
                              • 12\/12\/2016 : Enric Cosme Ll\u00f3pez.<\/b>\u00a0A complete axiomatization of isomorphism of treewidth 2 graphs, part 2<\/li>\n
                              • 5\/12\/2016 : Enric Cosme Ll\u00f3pez.<\/b>\u00a0A complete axiomatization of isomorphism of treewidth 2 graphs, part 1<\/li>\n
                              • 17\/11\/2016 : Radu Mardare<\/strong><\/em>.\u00a0Quantitative algebraic reasoning: towards a quantitative theory of effects<\/li>\n
                              • 17\/10\/2016 : Fr\u00e9d\u00e9ric Prost.<\/b>\u00a0Attributed graph rewriting with sub-structure cloning<\/li>\n
                              • 10\/10\/2016 : Yves-Stan Le Cornec.<\/b>\u00a0Model checking de syst\u00e8mes modulaires \u00e0 l’aide de r\u00e9ductions hi\u00e9rarchiques<\/li>\n
                              • 6\/10\/2016 : Georg Struth<\/strong><\/em>. Concurrent Kleene algebras and pomset languages<\/li>\n
                              • 3\/10\/2016 : Paul Brunet.<\/b>\u00a0Algebras of relations: from algorithms to formal proofs<\/li>\n
                              • 29\/09\/2016 : Peter Jipsen<\/strong><\/em>. Concurrent Kleene algebras with tests as algebraic models for concurrent programs<\/li>\n
                              • 26\/09\/2016 : Matias David Lee.<\/b>\u00a0Bisimulation over open terms for stream systems<\/li>\n
                              • 19\/09\/2016 : Damien Pous.<\/b>\u00a0Coinduction all the way up<\/li>\n<\/ul>\n

                                2015\/16<\/p>\n

                                  \n
                                • 27\/06\/2016 : Christian Doczkal.<\/i><\/b>\u00a0Informative completeness for decidable modal logics<\/li>\n
                                • 20\/06\/2016 : Russ Harmer.<\/b>\u00a0Implicit state simulation, part 2<\/li>\n
                                • 13\/06\/2016 : Russ Harmer.<\/b>\u00a0Implicit state simulation, part 1<\/li>\n
                                • 6\/06\/2016 : Anupam Das.<\/b>\u00a0Free-cut elimination in linear logic and an application to a feasible arithmetic<\/li>\n
                                • 30\/05\/2016 : Emmanuel Beffara.<\/b>\u00a0Proof-theoretical investigations in operational semantics, part 2<\/li>\n
                                • 23\/05\/2016 : Anupam Das.<\/b>\u00a0Linear rewriting systems for Boolean structures, part 2<\/li>\n
                                • 19\/05\/2016 : Anupam Das.<\/b>\u00a0Linear rewriting systems for Boolean structures, part 1<\/li>\n
                                • 9\/05\/2016 : Emmanuel Beffara.<\/b>\u00a0Proof-theoretical investigations in operational semantics, part 1<\/li>\n
                                • 2\/05\/2016 : Enric Cosme Ll\u00f3pez.<\/b>\u00a0Formations of monoids, congruences, and formal languages<\/li>\n
                                • 25\/04\/2016 : Enric Cosme Ll\u00f3pez.<\/b>\u00a0The dual equivalence of equations and co-equations for automata<\/li>\n
                                • 4\/04\/2016 : Fr\u00e9d\u00e9ric Prost.<\/b>\u00a0Parallelism in AGREE transformations<\/li>\n
                                • 24\/03\/2016 : Jim Laird<\/strong><\/em>. Game semantics for bounded polymorphism<\/li>\n
                                • 21\/03\/2016 : Dominique Duval.<\/i><\/b>\u00a0Decorated semantics for an imperative language with exceptions<\/li>\n
                                • 14\/03\/2016 : Colin Riba.<\/b>\u00a0Categories of tree automata, part 2<\/li>\n
                                • 7\/03\/2016 : Colin Riba.<\/b>\u00a0Categories of tree automata, part 1<\/li>\n
                                • 3\/03\/2016 : Daniel Leivant<\/strong><\/em>. Syntax directed reasoning in dynamic logic: a coinductive approach<\/li>\n
                                • 29\/02\/2016 : Simon Castellan.<\/b>\u00a0Weak memory models using event structures.<\/li>\n
                                • 8\/02\/2016 : Damien Pous.<\/b>\u00a0Coinduction for Verification and Certification: an overview<\/li>\n
                                • 1\/02\/2016 : Filippo Bonchi.<\/b>\u00a0Rewriting string diagrams via DPO<\/li>\n
                                • 25\/01\/2016 : Laure Gonnord.<\/i><\/b>\u00a0An encoding of array verification problems into array-free Horn clauses<\/li>\n
                                • 11\/01\/2016 : Ugo Dal Lago.<\/i><\/b>\u00a0Particles vs. waves: is multiplicity really necessary?<\/li>\n
                                • 14\/12\/2015 : Pierre Clairambault.<\/b>\u00a0Relating causal and interleaving concurrent game semantics<\/li>\n
                                • 7\/12\/2015 : Matteo Mio.<\/b>\u00a0Regular sets of trees and probability<\/li>\n
                                • 30\/11\/2015 : Laure Daviaud.<\/b>\u00a0A gentle introduction to the profinite theory of rational languages, part 2<\/li>\n
                                • 26\/11\/2015 : Luigi Santocanale<\/strong><\/em>. Fixed-point elimination in the intuitionistic propositional calculus<\/li>\n
                                • 23\/11\/2015 : Jurriaan Rot.<\/b>\u00a0Coalgebraic trace semantics via forgetful logics<\/li>\n
                                • 19\/11\/2015 : Denis Kuperberg<\/strong><\/em>. Good-for-Games automata versus deterministic automata<\/li>\n
                                • 16\/11\/2015 : Laure Daviaud.<\/b>\u00a0A gentle introduction to the profinite theory of rational languages, part 1<\/li>\n
                                • 12\/11\/2015 : Maciej Bendkowski & Katarzyna Grygiel<\/strong><\/em>. Lambda terms and their combinatorial representations<\/li>\n
                                • 9\/11\/2015 : J\u00e9r\u00f4me Feret<\/i><\/b>.<\/b>\u00a0An algebraic approach for inferring and using symmetries in rule-based models<\/li>\n
                                • 2\/11\/2015 : Matias David Lee.<\/b>\u00a0Logical characterization of bisimulation for transition relations over probability distributions with internal actions<\/li>\n
                                • 19\/10\/2015 : Adrien Basso-Blandin.<\/b>\u00a0A knowledge representation meta-model for rule-based modelling of signalling networks<\/li>\n
                                • 21\/09\/2015 : Olivier Laurent.<\/b>\u00a0Introduction \u00e0 la focalisation et application \u00e0 l’orthologique<\/li>\n<\/ul>\n

                                  2014\/15<\/p>\n

                                    \n
                                  • 15\/06\/2015 : Daniel Leivant<\/strong><\/em>. The computational contents of ramified co-recurrence<\/li>\n
                                  • 18\/05\/2015 : H\u00e9l\u00e8ne Coullon.<\/i><\/b>\u00a0Towards component-based high performance computing<\/li>\n
                                  • 11\/05\/2015 : Emmanuel Beffara.<\/b>\u00a0Vers l’unification des syst\u00e8mes de types pour processus mobiles<\/li>\n
                                  • 4\/05\/2015 : Fr\u00e9d\u00e9ric Prost.<\/b>\u00a0Social data anonymisation and graph transformations<\/li>\n
                                  • 27\/04\/2015 : Laure Gonnord.<\/i><\/b>\u00a0Validation of memory accesses through symbolic analyses<\/li>\n
                                  • 20\/04\/2015 : Paul Brunet.<\/b>\u00a0A Kleene theorem for Petri automata<\/li>\n
                                  • 2\/04\/2015 : Emmanuel Coquery<\/strong><\/em>. RQL: un langage \u201c\u00e0 la SQL\u201d pour d\u00e9couvrir des r\u00e8gles \u00e0 partir des donn\u00e9es<\/li>\n
                                  • 30\/03\/2015 : Patrick Baillot.<\/b>\u00a0Analyse de complexit\u00e9 par typage et r\u00e9ductions cryptographiques<\/li>\n
                                  • 16\/03\/2015 : Anupam Das.<\/b>\u00a0No complete linear term rewriting for propositional logic (probably)<\/li>\n
                                  • 9\/03\/2015 : Colin Riba.<\/b>\u00a0Representation of functions in second-order arithmetic and Girard’s System F<\/li>\n
                                  • 5\/03\/2015 : Laure Daviaud<\/strong><\/em>. Max-plus automata and size-change abstraction<\/li>\n
                                  • 2\/03\/2015 : Russ Harmer.<\/b>\u00a0Executable Knowledge<\/li>\n
                                  • 23\/02\/2015 : Damien Pous.<\/b>\u00a0Kozen’s proof of completeness for Kleene algebra<\/li>\n
                                  • 26\/01\/2015 : Pierre Clairambault.<\/b>\u00a0Introduction to normalization by evaluation<\/li>\n
                                  • 19\/01\/2015 : Olivier Laurent.<\/b>\u00a0Small Problems Related with Provability in Linear Logic<\/li>\n
                                  • 12\/01\/2015 : Alexandra Silva<\/i><\/b>.<\/b>\u00a0Automata Learning: A Categorical Perspective<\/li>\n
                                  • 5\/01\/2015 : Adrien Basso-Blandin.<\/b>\u00a0Conception d\u2019un langage d\u00e9di\u00e9 \u00e0 la conception de fonctions biologiques de synth\u00e8se par compilation de sp\u00e9cifications comportementales<\/li>\n
                                  • 8\/12\/2014 : Matteo Mio<\/strong>. An overview of monadic second order logic (MSO)<\/li>\n
                                  • 1\/12\/2014 : Pierre Clairambault<\/strong>. Game semantics and normalization by evaluation<\/li>\n
                                  • 24\/11\/2014 : Philippe Audebaud<\/strong>. Ciao Scott. Benvenuto Zariski<\/li>\n
                                  • 12\/11\/2014 : Jim Laird<\/strong><\/em>. Quantitative semantics for mobility<\/li>\n
                                  • 3\/11\/2014 : Simon Castellan<\/strong>. La strategie de la fourchette<\/li>\n
                                  • 13\/10\/2014 : Anupam Das<\/strong>. Some developments on the linear fragment of classical propositional logic<\/li>\n
                                  • 06\/10\/2014 : Fabio Zanasi<\/strong>. How to kill epsilons with a dagger – a coalgebraic take on systems with algebraic label structure<\/li>\n
                                  • 29\/09\/2014 : Paul Brunet<\/strong>. Decidability of identity-free relational Kleene lattices<\/li>\n
                                  • \u00a022\/09\/2014 : Emmanuel Beffara<\/strong>. Proofs as schedules<\/li>\n
                                  • 15\/09\/2014 : Fr\u00e9d\u00e9ric Prost<\/strong>. Graph Transformations : cloning issues<\/li>\n<\/ul>\n

                                    2014<\/p>\n