Follow
Paul-André Melliès
Paul-André Melliès
CNRS, Université Paris Cité
Verified email at irif.fr - Homepage
Title
Cited by
Cited by
Year
Concurrent games and full completeness
S Abramsky, PA Mellies
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
2491999
Categorical semantics of linear logic
PA Mellies
Panoramas et syntheses 27, 15-215, 2009
2482009
Typed λ-calculi with explicit substitutions may not terminate
PA Mellies
International Conference on Typed Lambda Calculi and Applications, 328-334, 1995
2031995
A very modal model of a modern, major, general type system
AW Appel, PA Mellies, CD Richards, J Vouillon
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2007
2022007
Asynchronous games: Innocence without alternation
PA Melliès, S Mimram
International Conference on Concurrency Theory, 395-411, 2007
942007
An abstract standardisation theorem
G Gonthier, JJ Lévy, PA Mellies
1992 Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer …, 1992
901992
Monads with arities and their associated theories
C Berger, PA Mellies, M Weber
Journal of Pure and Applied Algebra 216 (8-9), 2029-2048, 2012
822012
Functorial boxes in string diagrams
PA Melliès
International Workshop on Computer Science Logic, 1-30, 2006
812006
Asynchronous games 4: A fully complete model of propositional linear logic
PA Mellies
20th Annual IEEE Symposium on Logic in Computer Science (LICS'05), 386-395, 2005
802005
Categorical combinatorics for innocent strategies
R Harmer, M Hyland, PA Mellies
22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), 379-388, 2007
782007
Functors are type refinement systems
PA Melliès, N Zeilberger
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2015
742015
Resource modalities in tensor logic
PA Melliès, N Tabareau
Annals of Pure and Applied Logic 161 (5), 632-653, 2010
732010
Asynchronous games 2: The true concurrency of innocence
PA Melliès
Theoretical Computer Science 358 (2-3), 200-228, 2006
732006
Recursive polymorphic types and parametricity in an operational framework
PA Mellies, J Vouillon
20th Annual IEEE Symposium on Logic in Computer Science (LICS'05), 82-91, 2005
712005
Asynchronous games 2: the true concurrency of innocence
PA Mellies
International Conference on Concurrency Theory, 448-465, 2004
702004
Towards a formal theory of graded monads
S Fujii, S Katsumata, PA Mellies
International Conference on Foundations of Software Science and Computation …, 2016
622016
Game semantics in string diagrams
PA Melliès
2012 27th Annual IEEE Symposium on Logic in Computer Science, 481-490, 2012
622012
Categorical models of linear logic revisited
PA Mellies
572003
Asynchronous games 3 an innocent model of linear logic
PA Melliès
Electronic Notes in Theoretical Computer Science 122, 171-192, 2005
542005
An explicit formula for the free exponential modality of linear logic
PA Melliès, N Tabareau, C Tasson
International Colloquium on Automata, Languages, and Programming, 247-260, 2009
532009
The system can't perform the operation now. Try again later.
Articles 1–20