An abstract standardisation theorem - Georges Gonthier; Jean-Jacques Lévy; Paul-André Melliès (LICS, 1992)

Typed lambda-calculi with explicit substitutions may not terminate. - Paul-André Melliès (TLCA, 1995)

On the Subject Reduction Property for Algebraic Type Systems. - Gilles Barthe; Paul-André Melliès (CSL, 1996)

A Generic Normalisation Proof for Pure Type Systems. - Paul-André Melliès; Benjamin Werner (TYPES, 1996)

A Factorisation Theorem in Rewriting Theory. - Paul-André Melliès (Category Theory and Computer Science, 1997)

On a Duality Between Kruskal and Dershowitz Theorems. - Paul-André Melliès (ICALP, 1998)

A Stability Theorem in Rewriting Theory. - Paul-André Melliès (LICS, 1998)

Concurrent Games and Full Completeness. - Samson Abramsky; Paul-André Melliès (LICS, 1999)

Axiomatic rewriting theory II: the λσ-calculus enjoys finite normalisation cones. - Paul-André Melliès (J. Log. Comput., 2000)

Axiomatic Rewriting Theory VI Residual Theory Revisited. - Paul-André Melliès (RTA, 2002)

Double Categories: A Modular Model of Multiplicative Linear Logic. - Paul-André Melliès (Math. Struct. Comput. Sci., 2002)

Semantic types: a fresh look at the ideal model for types. - Jerome Vouillon; Paul-André Melliès (POPL, 2004)

Asynchronous Games 3 An Innocent Model of Linear Logic. - Paul-André Melliès (CTCS, 2004)

Comparing hierarchies of types in models of linear logic. - Paul-André Melliès (Inf. Comput., 2004)

Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem. - Paul-André Melliès (Processes, Terms and Cycles, 2005)

Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic. - Paul-André Melliès (LICS, 2005)

Recursive Polymorphic Types and Parametricity in an Operational Framework. - Paul-André Melliès; Jerome Vouillon (LICS, 2005)

Sequential algorithms and strongly stable functions. - Paul-André Melliès (Theor. Comput. Sci., 2005)

Functorial Boxes in String Diagrams. - Paul-André Melliès (CSL, 2006)

Asynchronous games 2: The true concurrency of innocence. - Paul-André Melliès (Theor. Comput. Sci., 2006)

Asynchronous Games: Innocence Without Alternation. - Paul-André Melliès; Samuel Mimram (CONCUR, 2007)

Categorical Combinatorics for Innocent Strategies. - Russell Harmer; Martin Hyland; Paul-André Melliès (LICS, 2007)

Resource modalities in game semantics. - Paul-André Melliès; Nicolas Tabareau (LICS, 2007)

A very modal model of a modern, major, general type system. - Andrew W. Appel; Paul-André Melliès; Christopher D. Richards; Jérôme Vouillon (POPL, 2007)

An Algebraic Account of References in Game Semantics. - Paul-André Melliès; Nicolas Tabareau (MFPS, 2009)

10252 Abstracts Collection - Game Semantics and Program Verification. - Paul-André Melliès; Andrzej S. Murawski; Andrea Schalk; Igor Walukiewicz (Game Semantics and Program Verification, 2010)

10252 Executive Summary - Game Semantics and Program Verification. - Paul-André Melliès; Andrzej S. Murawski; Andrea Schalk; Igor Walukiewicz (Game Semantics and Program Verification, 2010)

Segal Condition Meets Computational Effects. - Paul-André Melliès (LICS, 2010)

Resource modalities in tensor logic. - Paul-André Melliès; Nicolas Tabareau (Ann. Pure Appl. Log., 2010)

Game Semantics in String Diagrams. - Paul-André Melliès (LICS, 2012)

Dialogue Categories and Frobenius Monoids. - Paul-André Melliès (Computation, Logic, Games, and Quantum Foundations, 2013)

On dialogue games and coherent strategies. - Paul-André Melliès (CSL, 2013)

Type refinement and monoidal closed bifibrations. - Paul-André Melliès; Noam Zeilberger (CoRR, 2013)

Local States in String Diagrams. - Paul-André Melliès (RTA-TLCA, 2014)

Indexed linear logic and higher-order model checking. - Charles Grellois; Paul-André Melliès (ITRS, 2014)

Relational Semantics of Linear Logic and Higher-order Model Checking. - Charles Grellois; Paul-André Melliès (CSL, 2015)

An Infinitary Model of Linear Logic. - Charles Grellois; Paul-André Melliès (FoSSaCS, 2015)

A Fibrational Account of Local States. - Kenji Maillard; Paul-André Melliès (LICS, 2015)

Finitary Semantics of Linear Logic and Higher-Order Model-Checking. - Charles Grellois; Paul-André Melliès (MFCS (1), 2015)

Functors are Type Refinement Systems. - Paul-André Melliès; Noam Zeilberger (POPL, 2015)

Tensorial logic with colours and higher-order model checking. - Charles Grellois; Paul-André Melliès (CoRR, 2015)

Isbell Duality for Refinement Types. - Paul-André Melliès; Noam Zeilberger (CoRR, 2015)

Towards a Formal Theory of Graded Monads. - Soichiro Fujii; Shin-ya Katsumata; Paul-André Melliès (FoSSaCS, 2016)

A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine. - Paul-André Melliès; Noam Zeilberger (LICS, 2016)

Five Basic Concepts of Axiomatic Rewriting Theory. - Paul-André Melliès (CoRR, 2016)

Higher-order parity automata. - Paul-André Melliès (LICS, 2017)

A micrological study of negation. - Paul-André Melliès (Ann. Pure Appl. Log., 2017)

On bifibrations of model categories. - Pierre Cagne; Paul-André Melliès (CoRR, 2017)

The parametric continuation monad. - Paul-André Melliès (Math. Struct. Comput. Sci., 2017)

Categorical Combinatorics for Non Deterministic Strategies on Simple Games. - Clément Jacq; Paul-André Melliès (FoSSaCS, 2018)

Ribbon Tensorial Logic. - Paul-André Melliès (LICS, 2018)

An Asynchronous Soundness Theorem for Concurrent Separation Logic. - Paul-André Melliès; Léo Stefanesco (LICS, 2018)

On Dialogue Games and Graph Games. - Clément Jacq; Paul-André Melliès (MFPS, 2018)

A Game Semantics of Concurrent Separation Logic. - Paul-André Melliès; Léo Stefanesco (MFPS, 2018)

An explicit formula for the free exponential modality of linear logic. - Paul-André Melliès; Nicolas Tabareau; Christine Tasson (Math. Struct. Comput. Sci., 2018)

An Isbell duality theorem for type refinement systems. - Paul-André Melliès; Noam Zeilberger (Math. Struct. Comput. Sci., 2018)

Template games and differential linear logic. - Paul-André Melliès (LICS, 2019)

Categorical combinatorics of scheduling and synchronization in game semantics. - Paul-André Melliès (Proc. ACM Program. Lang., 2019)

Comprehension and Quotient Structures in the Language of 2-Categories. - Paul-André Melliès; Nicolas Rolland (FSCD, 2020)

Concurrent Separation Logic Meets Template Games. - Paul-André Melliès; Léo Stefanesco (LICS, 2020)

Asynchronous Template Games and the Gray Tensor Product of 2-Categories. - Paul-André Melliès (LICS, 2021)

A Functorial Excursion Between Algebraic Geometry and Linear Logic. - Paul-André Melliès (LICS, 2022)

Parsing as a lifting problem and the Chomsky-Schützenberger representation theorem. - Paul-André Melliès; Noam Zeilberger (MFPS, 2022)

Layered and object-based game semantics. - Arthur Oliveira Vale; Paul-André Melliès; Zhong Shao 001; Jérémie Koenig; Léo Stefanesco (Proc. ACM Program. Lang., 2022)

Convolution Products on Double Categories and Categorification of Rule Algebras. - Nicolas Behr; Paul-André Melliès; Noam Zeilberger (FSCD, 2023)

Profinite lambda-terms and parametricity. - Sam van Gool; Paul-André Melliès; Vincent Moreau 001 (MFPS, 2023)

The categorical contours of the Chomsky-Schützenberger representation theorem. - Paul-André Melliès; Noam Zeilberger (CoRR, 2024)

The categorical contours of the Chomsky-Sch "utzenberger representation theorem. - Paul-André Melliès; Noam Zeilberger (Log. Methods Comput. Sci., 2025)

Classical notions of computation and the Hasegawa-Thielecke theorem. - Éléonore Mangel; Paul-André Melliès; Guillaume Munch-Maccagnoni (CoRR, 2025)