BibSLEIGH — Paul-Andre

Travelled to:

1 × Austria
1 × Croatia
1 × France
1 × Germany
1 × Greece
1 × Hungary
1 × India
1 × Japan
1 × Poland
1 × The Netherlands
2 × Denmark
3 × Italy
3 × USA
3 × United Kingdom

Collaborated with:

∅ J.Vouillon C.Grellois N.Tabareau K.Maillard N.Zeilberger S.Abramsky G.Barthe C.Tasson R.Harmer M.Hyland G.Gonthier J.Lévy A.W.Appel C.D.Richards

Talks about:

type (7) game (6) semant (5) model (5) linear (4) logic (4) theorem (3) diagram (3) theori (3) system (3)

Person: Paul-André Melliès

DBLP: Melli=egrave=s:Paul=Andr=eacute=

Contributed to:

2015

2014

2013

2012

2010

2009

2007

2006

2005

2004

2002

1999

1998

1996

1995

1992

2019

Wrote 24 papers:

CSL-2015-GrelloisM #higher-order #linear #logic #model checking #relational #semantics: Relational Semantics of Linear Logic and Higher-order Model Checking (CG, PAM), pp. 260–276.
FoSSaCS-2015-GrelloisM #linear #logic: An Infinitary Model of Linear Logic (CG, PAM), pp. 41–55.
LICS-2015-MaillardM: A Fibrational Account of Local States (KM, PAM), pp. 402–413.
POPL-2015-MelliesZ #refinement: Functors are Type Refinement Systems (PAM, NZ), pp. 3–16.
RTA-TLCA-2014-Mellies #diagrams #string: Local States in String Diagrams (PAM), pp. 334–348.
CSL-2013-Mellies #game studies #on the: On dialogue games and coherent strategies (PAM), pp. 540–562.
LICS-2012-Mellies #diagrams #game studies #semantics #string: Game Semantics in String Diagrams (PAM), pp. 481–490.
LICS-2010-Mellies: Segal Condition Meets Computational Effects (PAM), pp. 150–159.
ICALP-v2-2009-MelliesTT #exponential #linear #logic: An Explicit Formula for the Free Exponential Modality of Linear Logic (PAM, NT, CT), pp. 247–260.
LICS-2007-HarmerHM #category theory #combinator: Categorical Combinatorics for Innocent Strategies (RH, MH, PAM), pp. 379–388.
LICS-2007-MelliesT #game studies #semantics: Resource modalities in game semantics (PAM, NT), pp. 389–398.
POPL-2007-AppelMRV #type system: A very modal model of a modern, major, general type system (AWA, PAM, CDR, JV), pp. 109–122.
CSL-2006-Mellies #diagrams #string: Functorial Boxes in String Diagrams (PAM), pp. 1–30.
LICS-2005-Mellies #game studies #linear #logic: Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic (PAM), pp. 386–395.
LICS-2005-MelliesV #framework #parametricity #polymorphism #recursion: Recursive Polymorphic Types and Parametricity in an Operational Framework (PAM, JV), pp. 82–91.
POPL-2004-VouillonM #fresh look #semantics: Semantic types: a fresh look at the ideal model for types (JV, PAM), pp. 52–63.
RTA-2002-Mellies #axiom #revisited: Axiomatic Rewriting Theory VI Residual Theory Revisited (PAM), pp. 24–50.
LICS-1999-AbramskyM #concurrent #game studies: Concurrent Games and Full Completeness (SA, PAM), pp. 431–442.
ICALP-1998-Mellies #on the #theorem: On a Duality Between Kruskal and Dershowitz Theorems (PAM), pp. 518–529.
LICS-1998-Mellies #theorem: A Stability Theorem in Rewriting Theory (PAM), pp. 287–298.
CSL-1996-BartheM #algebra #on the #reduction #type system: On the Subject Reduction Property for Algebraic Type Systems (GB, PAM), pp. 34–57.
TLCA-1995-Mellie #λ-calculus: Typed λ-calculi with explicit substitutions may not terminate (PAM), pp. 328–334.
LICS-1992-GonthierLM #standard #theorem: An abstract standardisation theorem (GG, JJL, PAM), pp. 72–81.
POPL-2019-Mellies #category theory #combinator #game studies #scheduling #semantics: Categorical combinatorics of scheduling and synchronization in game semantics (PAM), p. 30.