Paul-André Melliès

Cited by

	All	Since 2018
Citations	3120	1158
h-index	29	17
i10-index	51	32

240

120

180

199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220239 25 16 20 25 27 26 40 40 46 66 72 87 104 86 105 101 127 152 168 186 168 215 183 239 197 167 140 231

Public access

View all

8 articles

0 articles

available

not available

Based on funding mandates

Co-authors

nicolas tabareauInriaVerified email at inria.fr
Noam ZeilbergerEcole PolytechniqueVerified email at lix.polytechnique.fr
Charles GrelloisBordeaux INPVerified email at bordeaux-inp.fr
Jérôme VouillonCNRS, Université Paris DiderotVerified email at pps.univ-paris-diderot.fr
Samuel MimramLIX, École PolytechniqueVerified email at lix.polytechnique.fr
Samson AbramskyProfessor of Computer Science, UCLVerified email at ucl.ac.uk
Andrew W. AppelProfessor of Computer Science, Princeton UniversityVerified email at princeton.edu
Christine TassonMaître de conférenceVerified email at irif.fr
Leo StefanescoIRIF, Université Paris DiderotVerified email at ens-lyon.fr
Clemens BergerProfessor of Mathematics, University Côte d'AzurVerified email at math.unice.fr
Georges GonthierPrincipal Researcher, Microsoft ResearchVerified email at microsoft.com
Russ HarmerCNRS, LyonVerified email at ens-lyon.fr
Martin HylandProfessor of Mathematical Logic, CambridgeVerified email at dpmms.cam.ac.uk
Benjamin WernerProfesseur, Computer Science, Ecole PolytechniqueVerified email at polytechnique.edu
Gilles BartheMPI-SP and IMDEA Software InstituteVerified email at mpi-sp.org
Zhong ShaoYale UniversityVerified email at yale.edu
Jérémie KoenigPostdoctoral Associate, Yale UniversityVerified email at yale.edu
Sacha Bourgeois-GirondeProfessor, Dpt of Economics, Université Paris 2 ; Faculty of Law, University of HaifaVerified email at u-paris2.fr
Nicolas RollandVerified email at ensae.org

Paul-André Melliès

CNRS, Université Paris Cité

Verified email at irif.fr - Homepage

Semantics of proofs and programs


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Categorical semantics of linear logic PA Mellies Panoramas et syntheses 27, 15-215, 2009	288	2009
Concurrent games and full completeness S Abramsky, PA Mellies Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999	253	1999
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	207	2007
Typed λ-calculi with explicit substitutions may not terminate PA Mellies International Conference on Typed Lambda Calculi and Applications, 328-334, 1995	207	1995
Asynchronous games: Innocence without alternation PA Melliès, S Mimram International Conference on Concurrency Theory, 395-411, 2007	100	2007
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	98	2012
Functorial boxes in string diagrams PA Melliès International Workshop on Computer Science Logic, 1-30, 2006	94	2006
An abstract standardisation theorem G Gonthier, JJ Lévy, PA Mellies 1992 Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer …, 1992	94	1992
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	84	2005
Functors are type refinement systems PA Melliès, N Zeilberger Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2015	83	2015
Resource modalities in tensor logic PA Melliès, N Tabareau Annals of Pure and Applied Logic 161 (5), 632-653, 2010	79	2010
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	78	2007
Asynchronous games 2: The true concurrency of innocence PA Melliès Theoretical Computer Science 358 (2-3), 200-228, 2006	77	2006
Towards a formal theory of graded monads S Fujii, S Katsumata, PA Melliès International Conference on Foundations of Software Science and Computation …, 2016	75	2016
Asynchronous games 2: the true concurrency of innocence PA Mellies International Conference on Concurrency Theory, 448-465, 2004	72	2004
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	68	2005
Game semantics in string diagrams PA Melliès 2012 27th Annual IEEE Symposium on Logic in Computer Science, 481-490, 2012	64	2012
Categorical models of linear logic revisited PA Mellies	59	2003
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	57	2009
Asynchronous games 3 an innocent model of linear logic PA Melliès Electronic Notes in Theoretical Computer Science 122, 171-192, 2005	56	2005

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors