A cartesian-closed category for higher-order model checking. - Martin Hofmann 001; Jérémy Ledent (LICS, 2017)

Concurrent Specifications Beyond Linearizability. - Éric Goubault; Jérémy Ledent; Samuel Mimram (OPODIS, 2018)

Brief Announcement: On the Impossibility of Detecting Concurrency. - Éric Goubault; Jérémy Ledent; Samuel Mimram (DISC, 2018)

A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability. - Éric Goubault; Jérémy Ledent; Sergio Rajsbaum (GandALF, 2018)

A Sound Foundation for the Topological Approach to Task Solvability. - Jérémy Ledent; Samuel Mimram (CONCUR, 2019)

A Dynamic Epistemic Logic Analysis of the Equality Negation Task. - Éric Goubault; Marijana Lazic; Jérémy Ledent; Sergio Rajsbaum (DaLí, 2019)

Wait-Free Solvability of Equality Negation Tasks. - Éric Goubault; Marijana Lazic; Jérémy Ledent; Sergio Rajsbaum (DISC, 2019)

Geometric semantics for asynchronous computability. (Sémantique géométrique pour la calculabilité asynchrone). - Jérémy Ledent (2019)

Knowledge and simplicial complexes. - Hans van Ditmarsch; Eric Goubault; Jérémy Ledent; Sergio Rajsbaum (CoRR, 2020)

Compositional Game Theory, Compositionally. - Robert Atkey; Bruno Gavranovic; Neil Ghani; Clemens Kupke; Jérémy Ledent; Fredrik Nordvall Forsberg (ACT, 2020)

Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes. - Jérémy Ledent (PODC, 2021)

Translating Extensive Form Games to Open Games with Agency. - Matteo Capucci; Neil Ghani; Jérémy Ledent; Fredrik Nordvall Forsberg (ACT, 2021)

A Simplicial Model for KB4n: Epistemic Logic with Agents that May Die. - Eric Goubault; Jérémy Ledent; Sergio Rajsbaum (CoRR, 2021)

A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks. - Hans van Ditmarsch; Éric Goubault; Marijana Lazic; Jérémy Ledent; Sergio Rajsbaum (J. Log. Algebraic Methods Program., 2021)

A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die. - Éric Goubault; Jérémy Ledent; Sergio Rajsbaum (STACS, 2022)

Two-Agent Approximate Agreement from an Epistemic Logic Perspective. - Jorge Armenta-Segura; Jérémy Ledent; Sergio Rajsbaum (Computación y Sistemas, 2022)

A quantitative model for simply typed λ-calculus. - Martin Hofmann 001; Jérémy Ledent (Math. Struct. Comput. Sci., 2022)

Semi-Simplicial Set Models for Distributed Knowledge. - Éric Goubault; Roman Kniazev; Jérémy Ledent; Sergio Rajsbaum (LICS, 2023)

Simplicial Models for the Epistemic Logic of Faulty Agents. - Eric Goubault; Roman Kniazev; Jérémy Ledent; Sergio Rajsbaum (CoRR, 2023)

A Many-Sorted Epistemic Logic for Chromatic Hypergraphs. - Éric Goubault; Roman Kniazev; Jérémy Ledent (CSL, 2024)

Expressivity of Linear Temporal Logic for Pomset Languages of Higher Dimensional Automata. - Emily Clement; Enzo Erlich; Jérémy Ledent (CoRR, 2024)

A categorical and logical framework for iterated protocols. - Eric Goubault; Bernardo Hummes Flores; Roman Kniazev; Jérémy Ledent; Sergio Rajsbaum (CoRR, 2025)