| The Structural λ-Calculus B Accattoli, D Kesner International Workshop on Computer Science Logic, 381-395, 2010 | 109 | 2010 |
| Pure pattern calculus B Jay, D Kesner European Symposium on Programming, 100-114, 2006 | 89 | 2006 |
| Non-idempotent intersection types for the lambda-calculus A Bucciarelli, D Kesner, D Ventura Logic Journal of the IGPL 25 (4), 431-464, 2017 | 81 | 2017 |
| First-class patterns B Jay, D Kesner Journal of Functional Programming 19 (2), 191-225, 2009 | 80 | 2009 |
| First-class patterns B Jay, D Kesner Journal of Functional Programming 19 (2), 191-225, 2009 | 80 | 2009 |
| Resource operators for λ-calculus D Kesner, S Lengrand Information and Computation 205 (4), 419-473, 2007 | 73 | 2007 |
| A nonstandard standardization theorem B Accattoli, E Bonelli, D Kesner, C Lombardi ACM SIGPLAN Notices 49 (1), 659-670, 2014 | 72 | 2014 |
| The theory of calculi with explicit substitutions revisited D Kesner International Workshop on Computer Science Logic, 238-252, 2007 | 69 | 2007 |
| A theory of explicit substitutions with safe and full composition D Kesner Logical Methods in Computer Science 5, 2009 | 64 | 2009 |
| Simulating expansions without expansions R Di Cosmo, D Kesner Mathematical Structures in Computer Science 4 (3), 315-362, 1994 | 64 | 1994 |
| Strong normalization of explicit substitutions via cut elimination in proof nets R Di Cosmo, D Kesner Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 35-46, 1997 | 60 | 1997 |
| A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object RD Cosmo, D Kesner International Colloquium on Automata, Languages, and Programming, 645-656, 1993 | 60 | 1993 |
| Proof nets and explicit substitutions R Di Cosmo, D Kesner, E Polonovski Mathematical Structures in Computer Science 13 (3), 409-450, 2003 | 59 | 2003 |
| Reasoning about call-by-need by means of types D Kesner Foundations of Software Science and Computation Structures: 19th …, 2016 | 50 | 2016 |
| The inhabitation problem for non-idempotent intersection types A Bucciarelli, D Kesner, S Ronchi Della Rocca Theoretical Computer Science: 8th IFIP TC 1/WG 2.2 International Conference …, 2014 | 46 | 2014 |
| Quantitative types for the linear substitution calculus D Kesner, D Ventura Theoretical Computer Science: 8th IFIP TC 1/WG 2.2 International Conference …, 2014 | 43 | 2014 |
| The Permutative λ-Calculus B Accattoli, D Kesner International Conference on Logic for Programming Artificial Intelligence …, 2012 | 42 | 2012 |
| A typed pattern calculus D Kesner, L Puel, V Tannen Information and Computation 124 (1), 32-61, 1996 | 41 | 1996 |
| Types as resources for classical natural deduction D Kesner, P Vial 2nd International Conference on Formal Structures for Computation and …, 2017 | 38 | 2017 |
| Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions D Kesner International Conference on Rewriting Techniques and Applications, 184-199, 1996 | 38 | 1996 |
Roberto Di CosmoProfessor of Computer Science, University Paris DiderotVerified email at dicosmo.org
