Остановите войну!
for scientists:
default search action
Paul-André Melliès
- > Home > Persons > Paul-André Melliès
Publications
- 2022
- [c47]Paul-André Melliès:
A Functorial Excursion Between Algebraic Geometry and Linear Logic. LICS 2022: 64:1-64:13 - 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) - 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
- [c40]Paul-André Melliès:
Ribbon Tensorial Logic. LICS 2018: 689-698 - 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 - 2016
- [i10]Paul-André Melliès:
Five Basic Concepts of Axiomatic Rewriting Theory. CoRR abs/1609.09783 (2016) - 2014
- [c28]Paul-André Melliès:
Local States in String Diagrams. RTA-TLCA 2014: 334-348 - 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 - 2012
- [c24]Paul-André Melliès:
Game Semantics in String Diagrams. LICS 2012: 481-490 - 2010
- [c23]Paul-André Melliès:
Segal Condition Meets Computational Effects. LICS 2010: 150-159 - 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 - [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 - [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) - 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 - 1995
- [c2]Paul-André Melliès:
Typed lambda-calculi with explicit substitutions may not terminate. TLCA 1995: 328-334
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-04-25 02:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint