| 2026 | LICS | A Cartesian Closed Fibration of Higher-Order Regular Languages. | Paul-Andr Mellis, Vincent Moreau |
| 2023 | FSCD | Convolution Products on Double Categories and Categorification of Rule Algebras. | Nicolas Behr, Paul-Andr Mellis, Noam Zeilberger |
| 2022 | LICS | A Functorial Excursion Between Algebraic Geometry and Linear Logic. | Paul-Andr Mellis |
| 2021 | LICS | Asynchronous Template Games and the Gray Tensor Product of 2-Categories. | Paul-Andr Mellis |
| 2020 | FSCD | Comprehension and Quotient Structures in the Language of 2-Categories. | Paul-Andr Mellis, Nicolas Rolland |
| 2020 | LICS | Concurrent Separation Logic Meets Template Games. | Paul-Andr Mellis, Lo Stefanesco |
| 2019 | LICS | Template games and differential linear logic. | Paul-Andr Mellis |
| 2018 | FOSSACS | Categorical Combinatorics for Non Deterministic Strategies on Simple Games. | Clment Jacq, Paul-Andr Mellis |
| 2018 | LICS | Ribbon Tensorial Logic. | Paul-Andr Mellis |
| 2018 | LICS | An Asynchronous Soundness Theorem for Concurrent Separation Logic. | Paul-Andr Mellis, Lo Stefanesco |
| 2017 | LICS | Higher-order parity automata. | Paul-Andr Mellis |
| 2016 | FOSSACS | Towards a Formal Theory of Graded Monads. | Soichiro Fujii, Shin-ya Katsumata, Paul-Andr Mellis |
| 2016 | LICS | A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine. | Paul-Andr Mellis, Noam Zeilberger |
| 2015 | CSL | Relational Semantics of Linear Logic and Higher-order Model Checking. | Charles Grellois, Paul-Andr Mellis |
| 2015 | FOSSACS | An Infinitary Model of Linear Logic. | Charles Grellois, Paul-Andr Mellis |
| 2015 | LICS | A Fibrational Account of Local States. | Kenji Maillard, Paul-Andr Mellis |
| 2015 | MFCS | Finitary Semantics of Linear Logic and Higher-Order Model-Checking. | Charles Grellois, Paul-Andr Mellis |
| 2015 | POPL | Functors are Type Refinement Systems. | Paul-Andr Mellis, Noam Zeilberger |
| 2013 | CSL | On dialogue games and coherent strategies. | Paul-Andr Mellis |
| 2012 | LICS | Game Semantics in String Diagrams. | Paul-Andr Mellis |
| 2010 | LICS | Segal Condition Meets Computational Effects. | Paul-Andr Mellis |
| 2009 | ICALP | An Explicit Formula for the Free Exponential Modality of Linear Logic. | Paul-Andr Mellis, Nicolas Tabareau, Christine Tasson |
| 2007 | CONCUR | Asynchronous Games: Innocence Without Alternation. | Paul-Andr Mellis, Samuel Mimram |
| 2007 | LICS | Categorical Combinatorics for Innocent Strategies. | Russell Harmer, Martin Hyland, Paul-Andr Mellis |
| 2007 | LICS | Resource modalities in game semantics. | Paul-Andr Mellis, Nicolas Tabareau |
| 2007 | POPL | A very modal model of a modern, major, general type system. | Andrew W. Appel, Paul-Andr Mellis, Christopher D. Richards, Jrme Vouillon |
| 2006 | CSL | Functorial Boxes in String Diagrams. | Paul-Andr Mellis |
| 2005 | LICS | Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic. | Paul-Andr Mellis |
| 2005 | LICS | Recursive Polymorphic Types and Parametricity in an Operational Framework. | Paul-Andr Mellis, Jerome Vouillon |
| 2004 | CONCUR | Asynchronous Games 2: The True Concurrency of Innocence. | Paul-Andr Mellis |
| 2004 | POPL | Semantic types: a fresh look at the ideal model for types. | Jerome Vouillon, Paul-Andr Mellis |
| 1999 | LICS | Concurrent Games and Full Completeness. | Samson Abramsky, Paul-Andr Mellis |
| 1998 | ICALP | On a Duality Between Kruskal and Dershowitz Theorems. | Paul-Andr Mellis |
| 1998 | LICS | A Stability Theorem in Rewriting Theory. | Paul-Andr Mellis |
| 1996 | CSL | On the Subject Reduction Property for Algebraic Type Systems. | Gilles Barthe, Paul-Andr Mellis |
| 1992 | LICS | An abstract standardisation theorem | Georges Gonthier, Jean-Jacques Lvy, Paul-Andr Mellis |