| Categorical combinatorics of scheduling and synchronization in game semantics. | 1 | 0.36 | 2019 |
| A Game Semantics of Concurrent Separation Logic. | 0 | 0.34 | 2018 |
| Ribbon Tensorial Logic. | 0 | 0.34 | 2018 |
| Categorical Combinatorics for Non Deterministic Strategies on Simple Games. | 0 | 0.34 | 2018 |
| A micrological study of negation. | 0 | 0.34 | 2017 |
| On bifibrations of model categories | 0 | 0.34 | 2017 |
| A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine. | 0 | 0.34 | 2016 |
| Five Basic Concepts of Axiomatic Rewriting Theory. | 0 | 0.34 | 2016 |
| Towards a Formal Theory of Graded Monads. | 4 | 0.45 | 2016 |
| Functors are Type Refinement Systems | 7 | 0.55 | 2015 |
| Relational semantics of linear logic and higher-order model-checking | 5 | 0.45 | 2015 |
| Isbell Duality for Refinement Types. | 0 | 0.34 | 2015 |
| A Fibrational Account of Local States | 0 | 0.34 | 2015 |
| Indexed Linear Logic And Higher-Order Model Checking | 1 | 0.38 | 2015 |
| Finitary semantics of linear logic and higher-order model-checking. | 1 | 0.35 | 2015 |
| An Infinitary Model of Linear Logic. | 3 | 0.42 | 2014 |
| Local States in String Diagrams. | 1 | 0.38 | 2014 |
| Type refinement and monoidal closed bifibrations. | 0 | 0.34 | 2013 |
| On dialogue games and coherent strategies. | 1 | 0.38 | 2013 |
| Dialogue Categories and Frobenius Monoids. | 0 | 0.34 | 2013 |
| 10252 Abstracts Collection - Game Semantics and Program Verification. | 0 | 0.34 | 2010 |
| 10252 Executive Summary - Game Semantics and Program Verification. | 0 | 0.34 | 2010 |
| Resource modalities in tensor logic | 17 | 0.94 | 2010 |
| An Explicit Formula for the Free Exponential Modality of Linear Logic | 16 | 1.03 | 2009 |
| An Algebraic Account of References in Game Semantics | 4 | 0.43 | 2009 |
| Resource modalities in game semantics | 7 | 0.55 | 2007 |
| Asynchronous games: innocence without alternation | 13 | 0.80 | 2007 |
| Functorial boxes in string diagrams | 12 | 0.69 | 2006 |
| Asynchronous games 2: the true concurrency of innocence | 54 | 2.16 | 2006 |
| Axiomatic rewriting theory i: a diagrammatic standardization theorem | 1 | 0.37 | 2005 |
| Asynchronous Games 3 An Innocent Model of Linear Logic | 15 | 0.87 | 2005 |
| Sequential algorithms and strongly stable functions | 12 | 0.77 | 2005 |
| Comparing hierarchies of types in models of linear logic | 7 | 0.53 | 2004 |
| Axiomatic Rewriting Theory VI Residual Theory Revisited | 11 | 0.71 | 2002 |
| Double categories: a modular model of multiplicative linear logic | 4 | 0.46 | 2002 |
| Axiomatic rewriting theory II: the [lgr][sgr]-calculus enjoys finite normalisation cones | 5 | 0.50 | 2000 |
| Concurrent Games and Full Completeness | 69 | 4.02 | 1999 |
| On a Duality Between Kruskal and Dershowitz Theorems | 6 | 0.62 | 1998 |
| A Factorisation Theorem in Rewriting Theory | 8 | 0.67 | 1997 |
| A Generic Normalisation Proof for Pure Type Systems | 11 | 0.92 | 1996 |
| On the Subject Reduction Property for Algebraic Type Systems | 5 | 0.71 | 1996 |
| Typed lambda-calculi with explicit substitutions may not terminate | 57 | 2.98 | 1995 |
| An abstract standardisation theorem | 34 | 1.89 | 1992 |
