Paul-André Melliès

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 31

Top Topics

Top Venues

Math. Struct. Comput. Sci.

Publications

Paul-André Melliès, Noam Zeilberger
The categorical contours of the Chomsky-Schützenberger representation theorem. CoRR (2024)
Nicolas Behr, Paul-André Melliès, Noam Zeilberger
Convolution Products on Double Categories and Categorification of Rule Algebras. FSCD (2023)
Sam van Gool, Paul-André Melliès, Vincent Moreau
Profinite lambda-terms and parametricity. CoRR (2023)
Paul-André Melliès
A Functorial Excursion Between Algebraic Geometry and Linear Logic. LICS (2022)
Arthur Oliveira Vale, Paul-André Melliès, Zhong Shao, Jérémie Koenig, Léo Stefanesco
Layered and object-based game semantics. Proc. ACM Program. Lang. 6 (POPL) (2022)
Paul-André Melliès, Noam Zeilberger
Parsing as a lifting problem and the Chomsky-Schützenberger representation theorem. CoRR (2022)
Paul-André Melliès
Asynchronous Template Games and the Gray Tensor Product of 2-Categories. LICS (2021)
Paul-André Melliès
Asynchronous Template Games and the Gray Tensor Product of 2-Categories. CoRR (2021)
Paul-André Melliès, Léo Stefanesco
Concurrent Separation Logic Meets Template Games. CoRR (2020)
Paul-André Melliès, Léo Stefanesco
Concurrent Separation Logic Meets Template Games. LICS (2020)
Paul-André Melliès, Nicolas Rolland
Comprehension and quotient structures in the language of 2-categories. CoRR (2020)
Paul-André Melliès, Nicolas Rolland
Comprehension and Quotient Structures in the Language of 2-Categories. FSCD (2020)
Paul-André Melliès
Template games and differential linear logic. LICS (2019)
Paul-André Melliès
Categorical combinatorics of scheduling and synchronization in game semantics. Proc. ACM Program. Lang. 3 (POPL) (2019)
Clément Jacq, Paul-André Melliès
On Dialogue Games and Graph Games. MFPS (2018)
Paul-André Melliès, Noam Zeilberger
An Isbell duality theorem for type refinement systems. Math. Struct. Comput. Sci. 28 (6) (2018)
Paul-André Melliès
Ribbon Tensorial Logic. LICS (2018)
Clément Jacq, Paul-André Melliès
Categorical Combinatorics for Non Deterministic Strategies on Simple Games. FoSSaCS (2018)
Paul-André Melliès, Nicolas Tabareau, Christine Tasson
An explicit formula for the free exponential modality of linear logic. Math. Struct. Comput. Sci. 28 (7) (2018)
Paul-André Melliès, Léo Stefanesco
An Asynchronous Soundness Theorem for Concurrent Separation Logic. LICS (2018)
Paul-André Melliès, Léo Stefanesco
An Asynchronous soundness theorem for concurrent separation logic. CoRR (2018)
Paul-André Melliès, Léo Stefanesco
A Game Semantics of Concurrent Separation Logic. MFPS (2018)
Paul-André Melliès
Higher-order parity automata. LICS (2017)
Paul-André Melliès
The parametric continuation monad. Math. Struct. Comput. Sci. 27 (5) (2017)
Paul-André Melliès, Léo Stefanesco
A Game Semantics of Concurrent Separation Logic. CoRR (2017)
Pierre Cagne, Paul-André Melliès
On bifibrations of model categories. CoRR (2017)
Paul-André Melliès
A micrological study of negation. Ann. Pure Appl. Log. 168 (2) (2017)
Paul-André Melliès, Noam Zeilberger
A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine. CoRR (2016)
Soichiro Fujii, Shin-ya Katsumata, Paul-André Melliès
Towards a Formal Theory of Graded Monads. FoSSaCS (2016)
Paul-André Melliès, Noam Zeilberger
A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine. LICS (2016)
Paul-André Melliès
Five Basic Concepts of Axiomatic Rewriting Theory. CoRR (2016)
Charles Grellois, Paul-André Melliès
Finitary semantics of linear logic and higher-order model-checking. CoRR (2015)
Paul-André Melliès, Noam Zeilberger
Isbell Duality for Refinement Types. CoRR (2015)
Charles Grellois, Paul-André Melliès
An Infinitary Model of Linear Logic. FoSSaCS (2015)
Paul-André Melliès, Noam Zeilberger
Functors are Type Refinement Systems. POPL (2015)
Charles Grellois, Paul-André Melliès
Tensorial logic with colours and higher-order model checking. CoRR (2015)
Charles Grellois, Paul-André Melliès
Finitary Semantics of Linear Logic and Higher-Order Model-Checking. MFCS (1) (2015)
Charles Grellois, Paul-André Melliès
Relational Semantics of Linear Logic and Higher-order Model Checking. CSL (2015)
Kenji Maillard, Paul-André Melliès
A Fibrational Account of Local States. LICS (2015)
Charles Grellois, Paul-André Melliès
Indexed linear logic and higher-order model checking. ITRS (2014)
Paul-André Melliès
Local States in String Diagrams. RTA-TLCA (2014)
Charles Grellois, Paul-André Melliès
An infinitary model of linear logic. CoRR (2014)
Paul-André Melliès
On dialogue games and coherent strategies. CSL (2013)
Paul-André Melliès
Dialogue Categories and Frobenius Monoids. Computation, Logic, Games, and Quantum Foundations (2013)
Paul-André Melliès, Noam Zeilberger
Type refinement and monoidal closed bifibrations. CoRR (2013)
Paul-André Melliès
Game Semantics in String Diagrams. LICS (2012)
Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz
10252 Executive Summary - Game Semantics and Program Verification. Game Semantics and Program Verification (2010)
Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz
10252 Abstracts Collection - Game Semantics and Program Verification. Game Semantics and Program Verification (2010)
Paul-André Melliès, Nicolas Tabareau
Resource modalities in tensor logic. Ann. Pure Appl. Log. 161 (5) (2010)
Paul-André Melliès
Segal Condition Meets Computational Effects. LICS (2010)
Paul-André Melliès, Nicolas Tabareau, Christine Tasson
An Explicit Formula for the Free Exponential Modality of Linear Logic. ICALP (2) (2009)
Paul-André Melliès, Nicolas Tabareau
An Algebraic Account of References in Game Semantics. MFPS (2009)
Paul-André Melliès, Samuel Mimram
Asynchronous Games: Innocence Without Alternation. CONCUR (2007)
Russell Harmer, Martin Hyland, Paul-André Melliès
Categorical Combinatorics for Innocent Strategies. LICS (2007)
Paul-André Melliès, Nicolas Tabareau
Resource modalities in game semantics. LICS (2007)
Paul-André Melliès, Nicolas Tabareau
Resource modalities in game semantics CoRR (2007)
Paul-André Melliès, Samuel Mimram
Asynchronous games: innocence without alternation CoRR (2007)
Andrew W. Appel, Paul-André Melliès, Christopher D. Richards, Jérôme Vouillon
A very modal model of a modern, major, general type system. POPL (2007)
Paul-André Melliès
Asynchronous games 2: The true concurrency of innocence. Theor. Comput. Sci. 358 (2-3) (2006)
Paul-André Melliès
Functorial Boxes in String Diagrams. CSL (2006)
Paul-André Melliès
Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem. Processes, Terms and Cycles (2005)
Paul-André Melliès
Sequential algorithms and strongly stable functions. Theor. Comput. Sci. 343 (1-2) (2005)
Paul-André Melliès
Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic. LICS (2005)
Paul-André Melliès, Jerome Vouillon
Recursive Polymorphic Types and Parametricity in an Operational Framework. LICS (2005)
Paul-André Melliès
Asynchronous Games 2: The True Concurrency of Innocence. CONCUR (2004)
Jerome Vouillon, Paul-André Melliès
Semantic types: a fresh look at the ideal model for types. POPL (2004)
Paul-André Melliès
Comparing hierarchies of types in models of linear logic. Inf. Comput. 189 (2) (2004)
Paul-André Melliès
Asynchronous Games 3 An Innocent Model of Linear Logic. CTCS (2004)
Paul-André Melliès
Double Categories: A Modular Model of Multiplicative Linear Logic. Math. Struct. Comput. Sci. 12 (4) (2002)
Paul-André Melliès
Axiomatic Rewriting Theory VI Residual Theory Revisited. RTA (2002)
Paul-André Melliès
Axiomatic rewriting theory II: the λσ-calculus enjoys finite normalisation cones. J. Log. Comput. 10 (3) (2000)
Samson Abramsky, Paul-André Melliès
Concurrent Games and Full Completeness. LICS (1999)
Paul-André Melliès
On a Duality Between Kruskal and Dershowitz Theorems. ICALP (1998)
Paul-André Melliès
A Stability Theorem in Rewriting Theory. LICS (1998)
Paul-André Melliès
A Factorisation Theorem in Rewriting Theory. Category Theory and Computer Science (1997)
Paul-André Melliès, Benjamin Werner
A Generic Normalisation Proof for Pure Type Systems. TYPES (1996)
Gilles Barthe, Paul-André Melliès
On the Subject Reduction Property for Algebraic Type Systems. CSL (1996)
Paul-André Melliès
Typed lambda-calculi with explicit substitutions may not terminate. TLCA (1995)
Georges Gonthier, Jean-Jacques Lévy, Paul-André Melliès
An abstract standardisation theorem LICS (1992)