- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| c22 |      | |
| 2010 | ||
| j8 | | Paul-André Melliès, Nicolas Tabareau: Resource modalities in tensor logic. Ann. Pure Appl. Logic 161(5): 632-653 (2010) |
| c21 | | |
| 2009 | ||
| j7 | | Paul-André Melliès, Nicolas Tabareau: An Algebraic Account of References in Game Semantics. Electr. Notes Theor. Comput. Sci. 249: 377-405 (2009) |
| c20 | | Paul-André Melliès, Nicolas Tabareau, Christine Tasson: An Explicit Formula for the Free Exponential Modality of Linear Logic. ICALP (2) 2009: 247-260 |
| 2007 | ||
| c19 | | Paul-André Melliès, Samuel Mimram: Asynchronous Games: Innocence Without Alternation. CONCUR 2007: 395-411 |
| c18 | | Russell Harmer, Martin Hyland, Paul-André Melliès: Categorical Combinatorics for Innocent Strategies. LICS 2007: 379-388 |
| c17 | | |
| c16 | | 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: 109-122 |
| i2 | | Paul-André Melliès, Nicolas Tabareau: Resource modalities in game semantics. CoRR abs/0705.0462 (2007) |
| i1 | | Paul-André Melliès, Samuel Mimram: Asynchronous games: innocence without alternation. CoRR abs/0706.1118 (2007) |
| 2006 | ||
| j6 | | Paul-André Melliès: Asynchronous games 2: The true concurrency of innocence. Theor. Comput. Sci. 358(2-3): 200-228 (2006) |
| c15 | | |
| 2005 | ||
| j5 | | Paul-André Melliès: Asynchronous Games 3 An Innocent Model of Linear Logic. Electr. Notes Theor. Comput. Sci. 122: 171-192 (2005) |
| j4 | | Paul-André Melliès: Sequential algorithms and strongly stable functions. Theor. Comput. Sci. 343(1-2): 237-281 (2005) |
| c14 | | Paul-André Melliès: Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem. Processes, Terms and Cycles 2005: 554-638 |
| c13 | | Paul-André Melliès, Jerome Vouillon: Recursive Polymorphic Types and Parametricity in an Operational Framework. LICS 2005: 82-91 |
| c12 | | 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) |
| c11 | | |
| c10 | | Jerome Vouillon, Paul-André Melliès: Semantic types: a fresh look at the ideal model for types. POPL 2004: 52-63 |
| 2002 | ||
| j2 | | Paul-André Melliès: Double Categories: A Modular Model of Multiplicative Linear Logic. Mathematical Structures in Computer Science 12(4): 449-479 (2002) |
| c9 | | |
| 2000 | ||
| j1 | | Paul-André Melliès: Axiomatic rewriting theory II: the [lgr][sgr]-calculus enjoys finite normalisation cones. J. Log. Comput. 10(3): 461-487 (2000) |
| 1999 | ||
| c8 | | |
| 1998 | ||
| c7 | | |
| c6 | | |
| 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 |
Colors in the list of coauthors
Last update Sat May 25 08:07:03 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page