Aim
There is a remarkable divide in the field of logic in Computer Science between two distinct strands: one focuses on semantics and compositionality (“Structure”), the other on expressiveness and complexity (“Power”). These two traditions are studied by almost disjoint research communities using distinct technical languages and methods.
We believe that bringing these communities and research fields together is an important objective for Computer Science, which may hold the key to fundamental advances in the field. The aim of this workshop is to attract researchers working at the boundary of these two strands, as well as those on either side of the divide who are interested in establishing new connections.
Previous workshops on this theme were held as affiliated workshops of LiCS 2021, ICALP 2022, LiCS 2023 and LiCS 2024. This is a LiCS 2026 affiliated workshop, taking place at FLoC 2026.
Dates
| Workshop date: | 18 July 2026 |
| Abstract submission deadline: | 15 May 2026 |
| Author notification: | 30 May 2026 |
| Early-bird registration deadline: | 1 June 2026 |
Invited Speakers
- Ichiro Hasuo, National Institute of Informatics
- Cameron Calk, Laboratoire d’Informatique et Systèmes
Call for Participation
Researchers wishing to give a talk at the workshop are invited to submit an extended abstract of up to three pages (excluding references) describing the key points of the proposed presentation.
Submissions must have a single author, who will be the speaker. co-authors should be clearly credited in the abstract and on the slides.
For submissions please use the following Google form:We encourage submissions at all stages of development, including novel contributions, previously published work, work in progress, and survey-style presentations. Depending on the number of submissions, contributed talks will be 20–30 minutes in length.
Registration
In-person participation is via the main conference registration.
Programme
| Time | Event |
|---|---|
| 09:15 – 09:30 | Opening remarks |
| 09:30 – 10:30 | Invited talk: Ichiro Hasuo – Category Theory for Fast Model Checking Algorithms |
| 10:30 – 11:00 | Coffee break |
| 11:00 – 11:30 | Yoàv Montacute - Game Comonads and Coalgebras |
| 11:30 – 12:00 | Yun-Chen Tsai - Monads Distributive Law and Markov Decision Processes |
| 12:00 – 12:30 | Haitian Wang - A Categorical Perspective on Kripke Models and Dynamic Epistemic Logic |
| 12:30 – 14:00 | Lunch |
| 14:00 – 15:00 | Invited talk: Cameron Calk – Stone Duality Proofs for Distributed Computability Theorems |
| 15:00 – 15:30 | Coffee break |
| 15:30 – 16:00 | Gabriel Goren-Roig - Arboreal Adjunctions from Shapes |
| 16:00 – 16:30 | Elias Percy - Comonadic Approach to Hypertree Parameters and Loosely-Guarded Logics |
| 16:30 – 17:00 | Peter Hines - NP-completeness, and coherence for associativity |
Organising and Programme Committee
- Samson Abramsky
- Tomas Jakl
- Dan Marsden
- Yoàv Montacute
- Luca Reggio