| 2007 |
|---|
| 27 | EE | Paul-André Melliès,
Samuel Mimram:
Asynchronous Games: Innocence Without Alternation.
CONCUR 2007: 395-411 |
| 26 | EE | Russell Harmer,
Martin Hyland,
Paul-André Melliès:
Categorical Combinatorics for Innocent Strategies.
LICS 2007: 379-388 |
| 25 | EE | Paul-André Melliès,
Nicolas Tabareau:
Resource modalities in game semantics.
LICS 2007: 389-398 |
| 24 | EE | 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 |
| 23 | EE | Paul-André Melliès,
Nicolas Tabareau:
Resource modalities in game semantics
CoRR abs/0705.0462: (2007) |
| 22 | EE | Paul-André Melliès,
Samuel Mimram:
Asynchronous games: innocence without alternation
CoRR abs/0706.1118: (2007) |
| 2006 |
|---|
| 21 | EE | Paul-André Melliès:
Functorial Boxes in String Diagrams.
CSL 2006: 1-30 |
| 20 | EE | Paul-André Melliès:
Asynchronous games 2: The true concurrency of innocence.
Theor. Comput. Sci. 358(2-3): 200-228 (2006) |
| 2005 |
|---|
| 19 | EE | Paul-André Melliès:
Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic.
LICS 2005: 386-395 |
| 18 | EE | Paul-André Melliès,
Jerome Vouillon:
Recursive Polymorphic Types and Parametricity in an Operational Framework.
LICS 2005: 82-91 |
| 17 | EE | Paul-André Melliès:
Axiomatic Rewriting Theory I: A Diagrammatic Standardization Theorem.
Processes, Terms and Cycles 2005: 554-638 |
| 16 | EE | Paul-André Melliès:
Asynchronous Games 3 An Innocent Model of Linear Logic.
Electr. Notes Theor. Comput. Sci. 122: 171-192 (2005) |
| 15 | EE | Paul-André Melliès:
Sequential algorithms and strongly stable functions.
Theor. Comput. Sci. 343(1-2): 237-281 (2005) |
| 2004 |
|---|
| 14 | EE | Paul-André Melliès:
Asynchronous Games 2: The True Concurrency of Innocence.
CONCUR 2004: 448-465 |
| 13 | EE | Jerome Vouillon,
Paul-André Melliès:
Semantic types: a fresh look at the ideal model for types.
POPL 2004: 52-63 |
| 12 | EE | Paul-André Melliès:
Comparing hierarchies of types in models of linear logic.
Inf. Comput. 189(2): 202-234 (2004) |
| 2002 |
|---|
| 11 | EE | Paul-André Melliès:
Axiomatic Rewriting Theory VI Residual Theory Revisited.
RTA 2002: 24-50 |
| 10 | | Paul-André Melliès:
Double Categories: A Modular Model of Multiplicative Linear Logic.
Mathematical Structures in Computer Science 12(4): 449-479 (2002) |
| 2000 |
|---|
| 9 | | 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 |
|---|
| 8 | EE | Samson Abramsky,
Paul-André Melliès:
Concurrent Games and Full Completeness.
LICS 1999: 431-442 |
| 1998 |
|---|
| 7 | EE | Paul-André Melliès:
On a Duality Between Kruskal and Dershowitz Theorems.
ICALP 1998: 518-529 |
| 6 | | Paul-André Melliès:
A Stability Theorem in Rewriting Theory.
LICS 1998: 287-299 |
| 1997 |
|---|
| 5 | | Paul-André Melliès:
A Factorisation Theorem in Rewriting Theory.
Category Theory and Computer Science 1997: 49-68 |
| 1996 |
|---|
| 4 | | Gilles Barthe,
Paul-André Melliès:
On the Subject Reduction Property for Algebraic Type Systems.
CSL 1996: 34-57 |
| 3 | | Paul-André Melliès,
Benjamin Werner:
A Generic Normalisation Proof for Pure Type Systems.
TYPES 1996: 254-276 |
| 1995 |
|---|
| 2 | | Paul-André Melliès:
Typed lambda-calculi with explicit substitutions may not terminate.
TLCA 1995: 328-334 |
| 1992 |
|---|
| 1 | | Georges Gonthier,
Jean-Jacques Lévy,
Paul-André Melliès:
An abstract standardisation theorem
LICS 1992: 72-81 |
