| 2026 | CSL | Useful Call-by-Value: A Semantic Interpretation via Quantitative Types. | Pablo Barenbaum, Delia Kesner, Mariana Milicich |
| 2025 | CADE | A Fresh Inductive Approach to Useful Call-by-Value. | Pablo Barenbaum, Delia Kesner, Mariana Milicich |
| 2024 | APLAS | Extending the Quantitative Pattern-Matching Paradigm. | Sandra Alves, Delia Kesner, Miguel Ramos |
| 2024 | CSL | The Ackermann Award 2023. | Maribel Fernndez, Jean Goubault-Larrecq, Delia Kesner |
| 2024 | FSCD | Meaningfulness and Genericity in a Subsuming Framework (Invited Talk). | Delia Kesner, Victor Arrial, Giulio Guerrieri |
| 2024 | IJCAR | The Benefits of Diligence. | Victor Arrial, Giulio Guerrieri, Delia Kesner |
| 2024 | LICS | Genericity Through Stratification. | Victor Arrial, Giulio Guerrieri, Delia Kesner |
| 2024 | LPAR | Hybrid Intersection Types for PCF. | Pablo Barenbaum, Delia Kesner, Mariana Milicich |
| 2023 | WoLLIC | Quantitative Global Memory. | Sandra Alves, Delia Kesner, Miguel Ramos |
| 2022 | CSL | Encoding Tight Typing in a Unified Framework. | Delia Kesner, Andrs Viso |
| 2022 | FOSSACS | A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications. | Jos Esprito Santo, Delia Kesner, Loc Peyrot |
| 2022 | FSCD | Solvability for Generalized Applications. | Delia Kesner, Loc Peyrot |
| 2021 | FOSSACS | The Spirit of Node Replication. | Delia Kesner, Loc Peyrot, Daniel Ventura |
| 2020 | CSL | Strong Bisimulation for Control Operators (Invited Talk). | Delia Kesner, Eduardo Bonelli, Andrs Viso |
| 2020 | FLOPS | The Bang Calculus Revisited. | Antonio Bucciarelli, Delia Kesner, Alejandro Ros, Andrs Viso |
| 2020 | LICS | Consuming and Persistent Types for Classical Logic. | Delia Kesner, Pierre Vial |
| 2018 | FOSSACS | Call-by-Need, Neededness and All That. | Delia Kesner, Alejandro Ros, Andrs Viso |
| 2016 | FOSSACS | Reasoning About Call-by-need by Means of Types. | Delia Kesner |
| 2015 | ICTAC | A Resource Aware Computational Interpretation for Herbelin's Syntax. | Delia Kesner, Daniel Ventura |
| 2014 | POPL | A nonstandard standardization theorem. | Beniamino Accattoli, Eduardo Bonelli, Delia Kesner, Carlos Lombardi |
| 2012 | LPAR | The Permutative λ-Calculus. | Beniamino Accattoli, Delia Kesner |
| 2010 | CSL | The Structural | Beniamino Accattoli, Delia Kesner |
| 2009 | MFCS | The Prismoid of Resources. | Delia Kesner, Fabien Renaud |
| 2008 | ICALP | Perpetuality for Full and Safe Composition (in a Constructive Setting). | Delia Kesner |
| 2007 | CSL | The Theory of Calculi with Explicit Substitutions Revisited. | Delia Kesner |
| 2006 | CADE | Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic. | Roy Dyckhoff, Delia Kesner, Stphane Lengrand |
| 2006 | ESOP | Pure Pattern Calculus. | C. Barry Jay, Delia Kesner |
| 2000 | FOSSACS | Proof Nets and Explicit Substitutions. | Roberto Di Cosmo, Delia Kesner, Emmanuel Polonowski |
| 1999 | LICS | Pattern Matching as Cut Elimination. | Serenella Cerrito, Delia Kesner |
| 1998 | MFCS | Reducing AC-Termination to Termination. | Maria C. F. Ferreira, Delia Kesner, Laurence Puel |
| 1997 | LICS | Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract). | Roberto Di Cosmo, Delia Kesner |
| 1995 | CSL | Rewriting with Extensional Polymorphic Lambda-Calculus. | Roberto Di Cosmo, Delia Kesner |
| 1994 | ICALP | Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi. | Roberto Di Cosmo, Delia Kesner |
| 1993 | ICALP | A Confluent Reduction for the Extensional Typed lambda-Calculus with Pairs, Sums, Recursion and terminal Object. | Roberto Di Cosmo, Delia Kesner |
| 1993 | LICS | A Typed Pattern Calculus | Val Tannen, Delia Kesner, Laurence Puel |
| 1992 | CADE | Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors. | Delia Kesner |
| 1991 | MFCS | Pattern Matching in Order-Sorted Languages. | Delia Kesner |