[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]
==================================================
34th EACSL Annual Conference on Computer Science Logic (CSL 2026)
24–27 February 2026
Paris, France
https://urldefense.com/v3/__https://csl2026.github.io__;!!IBzWLUs!VJ53AixdZfHFGITmwckcbU5WkXrt3BoRGddeFJmOH8p8H2WyFkZXHxYHKq75Ckph4INwrYnx_2JLWq8_j5Dfb0D9OLJY0YSwPPqpma3iCiT5YRdrfQ$
Program:
https://urldefense.com/v3/__https://csl2026.github.io/program__;!!IBzWLUs!VJ53AixdZfHFGITmwckcbU5WkXrt3BoRGddeFJmOH8p8H2WyFkZXHxYHKq75Ckph4INwrYnx_2JLWq8_j5Dfb0D9OLJY0YSwPPqpma3iCiSrJ42j1g$
**** Registration:
https://urldefense.com/v3/__https://csl2026.github.io/registration__;!!IBzWLUs!VJ53AixdZfHFGITmwckcbU5WkXrt3BoRGddeFJmOH8p8H2WyFkZXHxYHKq75Ckph4INwrYnx_2JLWq8_j5Dfb0D9OLJY0YSwPPqpma3iCiSDjQhPxQ$
**** Early Bird registration ends on February 9
**** Additional fees apply after that date
--------------------------------------------------
Co-located workshops:
- FICS 2026 (Fixed Points in Computer Science)
23-24 February 2026
https://urldefense.com/v3/__https://fics2026.github.io__;!!IBzWLUs!VJ53AixdZfHFGITmwckcbU5WkXrt3BoRGddeFJmOH8p8H2WyFkZXHxYHKq75Ckph4INwrYnx_2JLWq8_j5Dfb0D9OLJY0YSwPPqpma3iCiTNp9ln8g$
- 14th Logic Mentoring Workshop
23 February 2026
https://urldefense.com/v3/__https://logic-mentoring-workshop.github.io/csl26/__;!!IBzWLUs!VJ53AixdZfHFGITmwckcbU5WkXrt3BoRGddeFJmOH8p8H2WyFkZXHxYHKq75Ckph4INwrYnx_2JLWq8_j5Dfb0D9OLJY0YSwPPqpma3iCiTR9gWvFA$
==================================================
You are warmly invited to attend CSL 2026, the 34th Annual Conference
on Computer Science Logic.
CSL is the annual conference of the European Association for Computer
Science Logic EACSL It is an interdisciplinary conference, spanning
across both basic and application oriented research in mathematical
logic and computer science.
CSL 2026 will take place 24-28 February 2026 in Paris, organised by
the Logic and Computation team of the LIPN of Sorbonne Paris Nord
University.
Invited speakers at CSL 2026 include:
- Pierre Clairambault (Aix-Marseille University, France)
- Sandra Kiefer (University of Oxford, UK)
- Gordon Plotkin (University of Edinburgh, UK)
- Ana Sokolova (University of Salzburg, Austria)
Topics of interest span the full breadth of logic and its applications
in computing, such as automated reasoning, concurrency, type theory,
formal methods, model checking, modal logics, computational
complexity, logic programming, quantum logic, semantics, verification,
and more — see the site
https://urldefense.com/v3/__https://csl2026.github.io__;!!IBzWLUs!VJ53AixdZfHFGITmwckcbU5WkXrt3BoRGddeFJmOH8p8H2WyFkZXHxYHKq75Ckph4INwrYnx_2JLWq8_j5Dfb0D9OLJY0YSwPPqpma3iCiT5YRdrfQ$
for the complete
list.
The conference will also host the award ceremonies for two major
distinctions in logic in computer science:
- The Ackermann Award, EACSL Outstanding Dissertation Award for Logic
in Computer Science
https://urldefense.com/v3/__https://www.eacsl.org/ackermann-award/__;!!IBzWLUs!VJ53AixdZfHFGITmwckcbU5WkXrt3BoRGddeFJmOH8p8H2WyFkZXHxYHKq75Ckph4INwrYnx_2JLWq8_j5Dfb0D9OLJY0YSwPPqpma3iCiQzu7B4BA$
- The Church Award Alonzo Church Award for Outstanding Contributions
to Logic and Computation, given by EATCS, which recognises
outstanding contributions to logic and computation by a researcher
for cumulative achievements.
https://urldefense.com/v3/__https://eatcs.org/index.php/church-award__;!!IBzWLUs!VJ53AixdZfHFGITmwckcbU5WkXrt3BoRGddeFJmOH8p8H2WyFkZXHxYHKq75Ckph4INwrYnx_2JLWq8_j5Dfb0D9OLJY0YSwPPqpma3iCiQ9H7Ncsw$
The Helena Rasiowa Award for the best student paper will be assigned to
the the best paper (as decided by the PC) written solely by students
or for which students were the main contributors.
==================================================
Programme CSL 2026, Paris
==========================
Tuesday, 24 February 2026
--------------------------
09:00 - 10:00 Invited talk: Pierre Clairambault
10:00 - 10:25 Break
10:25 - 12:30 Morning session (5 talks)
Manuel Bodirsky and Santiago Guzman Pro. Hereditary First-Order
Logic: the tractable quantifier prefix classes
Qipeng Kuang, Ondřej Kuželka, Yuanhong Wang and Yuyi Wang. Bridging
Weighted First Order Model Counting and Graph Polynomials
Nino Dauvier, Emmanuel Filiot and Pierre-Alain Reynier. Register-Bounded
Synthesis from Constraint LTL
Anuj Dawar, Lauri Hella and Benedikt Pago. Arity hierarchies for
quantifiers closed under partial polymorphisms
Nicolas Fröhlich, Phokion Kolaitis and Arne Meier. Disjunctions of Two
Dependence Atoms
12:30 - 13:50 Lunch
In parallel: EACSL board meeting
13:50 - 15:30 Early afternoon session (4 talks)
Mateo Torres-Ruiz, Robin Piedeleu, Alexandra Silva and Fabio Zanasi.
A Complete Diagrammatic Calculus for Conditional Gaussian Mixtures
Callum Reader and Alessandro Di Giorgio. String Diagrams for Closed
Symmetric Monoidal Categories
Sophie Brinke, Anuj Dawar, Erich Grädel, Lovro Mrkonjić and Matthias Naaf.
Compactness in Semiring Semantics
Zuzana Haniková and Filip Jankovec. Satisfiability in Łukasiewicz logic
and its unbounded relative
15:30 - 15:55 Break
16:05 - 18:00 Late afternoon session (5 talks)
Gianluca Curzi and Lukas Melgaard. Cyclic proof theory of positive
inductive definitions
Nicolas Peltier. On the Entailment Problem in Dynamic Separation Logic
with Inductive Definitions
Alexis Saurin and Esaïe Bauer. A uniform cut-elimination theorem for
linear logics with fixed points and super-exponentials
Antonella Bilotta, Marco Maggesi and Cosimo Perini Brogi. A modular
framework for proof-search via formalised modal completeness in HOL Light
Giulio Fellin. A Unifying Conservation Theorem
Wednesday, 25 February 2026
----------------------------
09:00 - 10:00 Invited talk: Sandra Kiefer
10:00 - 10:25 Break
10:25 - 12:25 Award session: Ackermann and Church awards
12:25 - 13:50 Lunch
13:50 - 15:05 Early afternoon session (3 talks)
Perry Hart. On Left Adjoints Preserving Colimits in HoTT
Samuel Mimram and Emile Oleon. Classifying covering types in
homotopy type theory
Davide Barbarossa and Thomas Powell. On the algorithmic structure of
Dialectica realisers
15:05 - 15:30 Break
15:30 - 16:30 Business meeting
Conference Dinner
Thursday, 26 February 2026
---------------------------
09:00 - 10:00 Invited talk: Gordon Plotkin
10:00 - 10:25 Break
10:25 - 12:30 Morning session (5 talks)
Mohamed Bandukara and Nikos Tzevelekos. A Logic for Fresh Labelled
Transition Systems
Henning Urbat and Thorsten Wißmann. Well-Founded Coalgebras Meet
König's Lemma
Ruben Turkenburg, Harsh Beohar, Franck van Breugel, Clemens Kupke and
Jurriaan Rot. Constructing Witnesses for Lower Bounds on Behavioural Distances
Josée Desharnais and Ana Sokolova. ε-Distance via Lévy-Prokhorov Lifting
Michael Benedikt, Chia-Hsuan Lu and Tony Tan. Analysis of logics with
arithmetic
12:30 - 13:50 Lunch
13:50 - 15:30 Early afternoon session (4 talks)
Matthew Earnshaw, Chad Nester and Mario Román. Resourceful traces
for commuting processes
Alessandro Di Giorgio, Pawel Sobocinski and Niels Voorneveld. Parametric
Iteration in Resource Theories
Rafael Dewes and Rayna Dimitrova. Reward Interfaces with Best-Effort
Implementations
Étienne André, Swen Jacobs and Engel Lefaucheux. Parametric disjunctive
timed networks
15:30 - 15:55 Break
16:05 - 18:00 Late afternoon session (5 talks)
Guy Avni and Suman Sadhukhan. Mean-payoff and Energy Discrete
Bidding Games
Isa Vialard. Deciding the Value of Two-Clock Almost Non-Zeno Weighted
Timed Games
Yoav Feinstein and Orna Kupferman. Memory Requirements in Non-Zero-Sum
Games
Sebastian Pfau. Boolean Basis and Succinctness of Modal Logic via
Hella-Vilander games
Gregoire Fournier and György Turán. A Game for Counting Logic Formula Size
and an Application to Linear Orders
Friday, 27 February 2026
---------------------------
09:00 - 10:00 Invited talk: Ana Sokolova
10:00 - 10:25 Break
10:25 - 12:30 Morning session (5 talks)
Valentin Pasquale and Álvaro García-Pérez. Towards the type safety
of Pure Subtype Systems
Daniël Otten and Matteo Spadetto. The biequivalence of path categories and
axiomatic Martin-Löf type theories
Yoan Géran. A Canonical Form for Universe Levels in Impredicative Type
Theory
Thorsten Altenkirch, Ambrus Kaposi and Szumi Xie. The Groupoid-syntax of
Type Theory is a Set
Fatemeh Ghasemi, Julien Grange, Mamadou Moustapha Kanté and Florent
Madelaine. Weakly-sparse and strongly flip-flat classes of graphs are
almost-wide
12:30 - 13:50 Lunch
13:50 - 15:30 Early afternoon session (4 talks)
Stéphane Demri and Tianwen Gu. Robustness of Constraint Automata for
Description Logics with Concrete Domains
Emily Clement, Enzo Erlich and Jérémy Ledent. Kamp theorem for Higher
Dimensional Automata
Jan J.M. Martens. Minimal DFAs Witnessing Language Inequivalence
Samuel Graepler, Benjamin Monmege and Jean-Marc Talbot. Reasoning about
Quality in Hyperproperties
15:30 - 15:55 Break
16:05 - 17:10 Late afternoon session (3 talks)
Nachiappan Valliappan. Lax Modal Lambda Calculi
Pablo Barenbaum, Delia Kesner and Mariana Milicich. Useful Call-by-Value:
A Semantic Interpretation via Quantitative Types
Radu Mardare, Robert Furber, Prakash Panangaden and Dana Scott.
Interpreting Lambda Calculus in Domain-Valued Random Variables
=====================================
Stefano Guerrini
Professeur des Universités
Institut Galilée, Université Sorbonne Paris Nord (USPN)
Laboratoire d'Informatique de Paris-Nord (LIPN), CNRS (UMR 7030)
[email protected]
