default search action
Paul-André Melliès
Person information
- affiliation: Pierre and Marie Curie University, Paris, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i18]Paul-André Melliès, Noam Zeilberger:
The categorical contours of the Chomsky-Schützenberger representation theorem. CoRR abs/2405.14703 (2024) - 2023
- [c49]Nicolas Behr, Paul-André Melliès, Noam Zeilberger:
Convolution Products on Double Categories and Categorification of Rule Algebras. FSCD 2023: 17:1-17:20 - [c48]Sam van Gool, Paul-André Melliès, Vincent Moreau:
Profinite lambda-terms and parametricity. MFPS 2023 - 2022
- [j12]Arthur Oliveira Vale
, Paul-André Melliès
Layered and object-based game semantics. Proc. ACM Program. Lang. 6(POPL): 1-32 (2022) - [c47]Paul-André Melliès:
A Functorial Excursion Between Algebraic Geometry and Linear Logic. LICS 2022: 64:1-64:13 - [c46]Paul-André Melliès, Noam Zeilberger:
Parsing as a lifting problem and the Chomsky-Schützenberger representation theorem. MFPS 2022 - 2021
- [c45]Paul-André Melliès
Asynchronous Template Games and the Gray Tensor Product of 2-Categories. LICS 2021: 1-13 - [i17]Paul-André Melliès
Asynchronous Template Games and the Gray Tensor Product of 2-Categories. CoRR abs/2105.04929 (2021) - 2020
- [c44]Paul-André Melliès, Nicolas Rolland:
Comprehension and Quotient Structures in the Language of 2-Categories. FSCD 2020: 6:1-6:18 - [c43]Paul-André Melliès, Léo Stefanesco:
Concurrent Separation Logic Meets Template Games. LICS 2020: 742-755 - [i16]Paul-André Melliès, Léo Stefanesco:
Concurrent Separation Logic Meets Template Games. CoRR abs/2005.04453 (2020) - [i15]Paul-André Melliès, Nicolas Rolland
Comprehension and quotient structures in the language of 2-categories. CoRR abs/2005.10015 (2020)
2010 – 2019
- 2019
- [j11]Paul-André Melliès
Categorical combinatorics of scheduling and synchronization in game semantics. Proc. ACM Program. Lang. 3(POPL): 23:1-23:30 (2019) - [c42]Paul-André Melliès
Template games and differential linear logic. LICS 2019: 1-13 - 2018
- [j10]Paul-André Melliès, Noam Zeilberger:
An Isbell duality theorem for type refinement systems. Math. Struct. Comput. Sci. 28(6): 736-774 (2018) - [j9]Paul-André Melliès
An explicit formula for the free exponential modality of linear logic. Math. Struct. Comput. Sci. 28(7): 1253-1286 (2018) - [c41]Clément Jacq, Paul-André Melliès
Categorical Combinatorics for Non Deterministic Strategies on Simple Games. FoSSaCS 2018: 39-70 - [c40]Paul-André Melliès
Ribbon Tensorial Logic. LICS 2018: 689-698 - [c39]Paul-André Melliès, Léo Stefanesco:
An Asynchronous Soundness Theorem for Concurrent Separation Logic. LICS 2018: 699-708 - [c38]Clément Jacq, Paul-André Melliès:
On Dialogue Games and Graph Games. MFPS 2018: 189-206 - [c37]Paul-André Melliès, Léo Stefanesco:
A Game Semantics of Concurrent Separation Logic. MFPS 2018: 241-256 - [i14]Paul-André Melliès, Léo Stefanesco:
An Asynchronous soundness theorem for concurrent separation logic. CoRR abs/1807.08117 (2018) - 2017
- [j8]Paul-André Melliès:
A micrological study of negation. Ann. Pure Appl. Log. 168(2): 321-372 (2017) - [j7]Paul-André Melliès:
The parametric continuation monad. Math. Struct. Comput. Sci. 27(5): 651-680 (2017) - [c36]Paul-André Melliès:
Higher-order parity automata. LICS 2017: 1-12 - [i13]Pierre Cagne, Paul-André Melliès:
On bifibrations of model categories. CoRR abs/1709.10484 (2017) - [i12]Paul-André Melliès, Léo Stefanesco:
A Game Semantics of Concurrent Separation Logic. CoRR abs/1710.02332 (2017) - 2016
- [c35]Soichiro Fujii, Shin-ya Katsumata
Towards a Formal Theory of Graded Monads. FoSSaCS 2016: 513-530 - [c34]Paul-André Melliès, Noam Zeilberger:
A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine. LICS 2016: 555-564 - [i11]Paul-André Melliès
A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine. CoRR abs/1601.06098 (2016) - [i10]Paul-André Melliès:
Five Basic Concepts of Axiomatic Rewriting Theory. CoRR abs/1609.09783 (2016) - 2015
- [c33]Charles Grellois, Paul-André Melliès:
Relational Semantics of Linear Logic and Higher-order Model Checking. CSL 2015: 260-276 - [c32]Charles Grellois, Paul-André Melliès:
An Infinitary Model of Linear Logic. FoSSaCS 2015: 41-55 - [c31]Kenji Maillard
A Fibrational Account of Local States. LICS 2015: 402-413 - [c30]Charles Grellois, Paul-André Melliès:
Finitary Semantics of Linear Logic and Higher-Order Model-Checking. MFCS (1) 2015: 256-268 - [c29]Paul-André Melliès
Functors are Type Refinement Systems. POPL 2015: 3-16 - [i9]Charles Grellois, Paul-André Melliès:
Tensorial logic with colours and higher-order model checking. CoRR abs/1501.04789 (2015) - [i8]Paul-André Melliès
Isbell Duality for Refinement Types. CoRR abs/1501.05115 (2015) - [i7]Charles Grellois, Paul-André Melliès:
Finitary semantics of linear logic and higher-order model-checking. CoRR abs/1502.05147 (2015) - 2014
- [c28]Paul-André Melliès:
Local States in String Diagrams. RTA-TLCA 2014: 334-348 - [c27]Charles Grellois, Paul-André Melliès:
Indexed linear logic and higher-order model checking. ITRS 2014: 43-52 - [i6]Charles Grellois, Paul-André Melliès:
An infinitary model of linear logic. CoRR abs/1411.4380 (2014) - 2013
- [c26]Paul-André Melliès:
Dialogue Categories and Frobenius Monoids. Computation, Logic, Games, and Quantum Foundations 2013: 197-224 - [c25]Paul-André Melliès:
On dialogue games and coherent strategies. CSL 2013: 540-562 - [i5]Paul-André Melliès, Noam Zeilberger:
Type refinement and monoidal closed bifibrations. CoRR abs/1310.0263 (2013) - 2012
- [c24]Paul-André Melliès:
Game Semantics in String Diagrams. LICS 2012: 481-490 - 2010
- [j6]Paul-André Melliès
Resource modalities in tensor logic. Ann. Pure Appl. Log. 161(5): 632-653 (2010) - [c23]Paul-André Melliès:
Segal Condition Meets Computational Effects. LICS 2010: 150-159 - [e1]Paul-André Melliès, Andrzej S. Murawski, Andrea Schalk, Igor Walukiewicz:
Game Semantics and Program Verification, 20.06. - 25.06.2010. Dagstuhl Seminar Proceedings 10252, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents] - [i4]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 - [i3]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
2000 – 2009
- 2009
- [c22]Paul-André Melliès
An Explicit Formula for the Free Exponential Modality of Linear Logic. ICALP (2) 2009: 247-260 - [c21]Paul-André Melliès, Nicolas Tabareau:
An Algebraic Account of References in Game Semantics. MFPS 2009: 377-405 - 2007
- [c20]Paul-André Melliès, Samuel Mimram:
Asynchronous Games: Innocence Without Alternation. CONCUR 2007: 395-411 - [c19]Russell Harmer, Martin Hyland, Paul-André Melliès:
Categorical Combinatorics for Innocent Strategies. LICS 2007: 379-388 - [c18]Paul-André Melliès, Nicolas Tabareau:
Resource modalities in game semantics. LICS 2007: 389-398 - [c17]Andrew W. Appel
A very modal model of a modern, major, general type system. POPL 2007: 109-122 - [i2]Paul-André Melliès
Resource modalities in game semantics. CoRR abs/0705.0462 (2007) - [i1]Paul-André Melliès
Asynchronous games: innocence without alternation. CoRR abs/0706.1118 (2007) - 2006
- [j5]Paul-André Melliès
Asynchronous games 2: The true concurrency of innocence. Theor. Comput. Sci. 358(2-3): 200-228 (2006) - [c16]Paul-André Melliès:
Functorial Boxes in String Diagrams. CSL 2006: 1-30 - 2005
- [j4]Paul-André Melliès
Sequential algorithms and strongly stable functions. Theor. Comput. Sci. 343(1-2): 237-281 (2005) - [c15]Paul-André Melliès:
Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem. Processes, Terms and Cycles 2005: 554-638 - [c14]Paul-André Melliès
Recursive Polymorphic Types and Parametricity in an Operational Framework. LICS 2005: 82-91 - [c13]Paul-André Melliès:
Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic. LICS 2005: 386-395 - 2004
- [j3]Paul-André Melliès:
Comparing hierarchies of types in models of linear logic. Inf. Comput. 189(2): 202-234 (2004) - [c12]Paul-André Melliès:
Asynchronous Games 2: The True Concurrency of Innocence. CONCUR 2004: 448-465 - [c11]Jerome Vouillon, Paul-André Melliès
Semantic types: a fresh look at the ideal model for types. POPL 2004: 52-63 - [c10]Paul-André Melliès
Asynchronous Games 3 An Innocent Model of Linear Logic. CTCS 2004: 171-192 - 2002
- [j2]Paul-André Melliès:
Double Categories: A Modular Model of Multiplicative Linear Logic. Math. Struct. Comput. Sci. 12(4): 449-479 (2002) - [c9]Paul-André Melliès:
Axiomatic Rewriting Theory VI Residual Theory Revisited. RTA 2002: 24-50 - 2000
- [j1]Paul-André Melliès:
Axiomatic rewriting theory II: the λσ-calculus enjoys finite normalisation cones. J. Log. Comput. 10(3): 461-487 (2000)
1990 – 1999
- 1999
- [c8]Samson Abramsky
Concurrent Games and Full Completeness. LICS 1999: 431-442 - 1998
- [c7]Paul-André Melliès:
On a Duality Between Kruskal and Dershowitz Theorems. ICALP 1998: 518-529 - [c6]Paul-André Melliès:
A Stability Theorem in Rewriting Theory. LICS 1998: 287-298 - 1997
- [c5]Paul-André Melliès:
A Factorisation Theorem in Rewriting Theory. Category Theory and Computer Science 1997: 49-68 - 1996
- [c4]Gilles Barthe, Paul-André Melliès:
On the Subject Reduction Property for Algebraic Type Systems. CSL 1996: 34-57 - [c3]Paul-André Melliès, Benjamin Werner:
A Generic Normalisation Proof for Pure Type Systems. TYPES 1996: 254-276 - 1995
- [c2]Paul-André Melliès:
Typed lambda-calculi with explicit substitutions may not terminate. TLCA 1995: 328-334 - 1992
- [c1]Georges Gonthier, Jean-Jacques Lévy, Paul-André Melliès:
An abstract standardisation theorem. LICS 1992: 72-81
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-25 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: