Paul-André Melliès 个人学术档案

引用次数

	总计	2019 年至今
引用	3258	1119
h 指数	30	17
i10 指数	54	32

260

130

195

1996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202425 16 18 30 31 26 43 42 46 65 71 89 90 90 107 100 128 152 173 186 165 202 184 242 194 158 135 252 137

开放获取的出版物数量

查看全部

8 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

nicolas tabareauInria在 inria.fr 的电子邮件经过验证
Noam ZeilbergerEcole Polytechnique在 lix.polytechnique.fr 的电子邮件经过验证
Charles GrelloisUniversity of Sheffield在 sheffield.ac.uk 的电子邮件经过验证
Jérôme VouillonCNRS, Université Paris Diderot在 pps.univ-paris-diderot.fr 的电子邮件经过验证
Samuel MimramLIX, CNRS, École polytechnique, Institut Polytechnique de Paris在 polytechnique.edu 的电子邮件经过验证
Samson AbramskyProfessor of Computer Science, UCL在 ucl.ac.uk 的电子邮件经过验证
Andrew W. AppelProfessor of Computer Science, Princeton University在 princeton.edu 的电子邮件经过验证
Leo StefanescoMPI-SWS在 mpi-sws.org 的电子邮件经过验证
Christine TassonProfessor在 isae-supaero.fr 的电子邮件经过验证
Clemens BergerProfessor of Mathematics, University Côte d'Azur在 math.unice.fr 的电子邮件经过验证
Georges GonthierPrincipal Researcher, Microsoft Research在 microsoft.com 的电子邮件经过验证
Russ HarmerCNRS, Lyon在 ens-lyon.fr 的电子邮件经过验证
Martin HylandProfessor of Mathematical Logic, Cambridge在 dpmms.cam.ac.uk 的电子邮件经过验证
Benjamin WernerProfesseur, Computer Science, Ecole Polytechnique在 polytechnique.edu 的电子邮件经过验证
Gilles BartheMPI-SP and IMDEA Software Institute在 mpi-sp.org 的电子邮件经过验证
Zhong ShaoYale University在 yale.edu 的电子邮件经过验证
Jérémie KoenigPostdoctoral Associate, Yale University在 yale.edu 的电子邮件经过验证
Sacha Bourgeois-GirondeProfessor, Dpt of Economics, Université Paris 2 ; Faculty of Law, University of Haifa在 u-paris2.fr 的电子邮件经过验证
Nicolas Rolland在 ensae.org 的电子邮件经过验证

关注

Paul-André Melliès

CNRS, Université Paris Cité

在 irif.fr 的电子邮件经过验证 - 首页

Semantics of proofs and programs


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Categorical semantics of linear logic PA Mellies Panoramas et syntheses 27, 15-215, 2009	306	2009
Concurrent games and full completeness S Abramsky, PA Mellies Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999	262	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	216	2007
Typed λ-calculi with explicit substitutions may not terminate PA Mellies International Conference on Typed Lambda Calculi and Applications, 328-334, 1995	212	1995
Asynchronous games: Innocence without alternation PA Melliès, S Mimram International Conference on Concurrency Theory, 395-411, 2007	106	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	104	2012
Functorial boxes in string diagrams PA Melliès International Workshop on Computer Science Logic, 1-30, 2006	99	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	97	1992
Functors are type refinement systems PA Melliès, N Zeilberger Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2015	87	2015
Resource modalities in tensor logic PA Melliès, N Tabareau Annals of Pure and Applied Logic 161 (5), 632-653, 2010	82	2010
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	82	2005
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	81	2007
Asynchronous games 2: The true concurrency of innocence PA Melliès Theoretical Computer Science 358 (2-3), 200-228, 2006	80	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	79	2016
Asynchronous games 2: the true concurrency of innocence PA Mellies International Conference on Concurrency Theory, 448-465, 2004	70	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	66	2012
Categorical models of linear logic revisited PA Mellies	59	2003
Asynchronous games 3 an innocent model of linear logic PA Melliès Electronic Notes in Theoretical Computer Science 122, 171-192, 2005	55	2005
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	54	2009

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用