Pattern Matching in Order-Sorted Languages. - Delia Kesner (MFCS, 1991)

Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors. - Delia Kesner (CADE, 1992)

A Confluent Reduction for the Extensional Typed lambda-Calculus with Pairs, Sums, Recursion and terminal Object. - Roberto Di Cosmo; Delia Kesner (ICALP, 1993)

Reasoning about Layered, Wildcard and Product Patterns. - Delia Kesner (ALP, 1994)

Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi. - Roberto Di Cosmo; Delia Kesner (ICALP, 1994)

Simulating Expansions without Expansions. - Roberto Di Cosmo; Delia Kesner (Math. Struct. Comput. Sci., 1994)

Rewriting with Extensional Polymorphic Lambda-Calculus. - Roberto Di Cosmo; Delia Kesner (CSL, 1995)

Lambda-Calculi with Explicit Substitutions and Composition Which Preserve Beta-Strong Normalization. - Maria C. F. Ferreira; Delia Kesner; Laurence Puel (ALP, 1996)

Confluence Properties of Extensional and Non-Extensional lambda-Calculi with Explicit Substitutions (Extended Abstract). - Delia Kesner (RTA, 1996)

A Typed Pattern Calculus. - Delia Kesner; Laurence Puel; Val Tannen (Inf. Comput., 1996)

Combining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints. - Roberto Di Cosmo; Delia Kesner (Theor. Comput. Sci., 1996)

Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract). - Roberto Di Cosmo; Delia Kesner (LICS, 1997)

Reasoning about Redundant Patterns. - Delia Kesner (J. Funct. Log. Program., 1997)

Reducing AC-Termination to Termination. - Maria C. F. Ferreira; Delia Kesner; Laurence Puel (MFCS, 1998)

lambda-Calculi with Explicit Substitutions Preserving Strong Normalization. - Maria C. F. Ferreira; Delia Kesner; Laurence Puel (Appl. Algebra Eng. Commun. Comput., 1999)

Explicit Substitutions for Objects and Functions - Delia Kesner; Pablo E. Martínez López (J. Funct. Log. Program., 1999)

A de Bruijn Notation for Higher-Order Rewriting. - Eduardo Bonelli; Delia Kesner; Alejandro Ríos 001 (RTA, 2000)

Confluence of extensional and non-extensional lambda-calculi with explicit substitutions. - Delia Kesner (Theor. Comput. Sci., 2000)

From Higher-Order to First-Order Rewriting. - Eduardo Bonelli; Delia Kesner; Alejandro Ríos 001 (RTA, 2001)

Theory and applications of explicit substitutions: Introduction. - Delia Kesner (Math. Struct. Comput. Sci., 2001)

Proof Nets And Explicit Substitutions. - Roberto Di Cosmo; Delia Kesner; Emmanuel Polonowski (Math. Struct. Comput. Sci., 2003)

Pattern matching as cut elimination. - Serenella Cerrito; Delia Kesner (Theor. Comput. Sci., 2004)

Expression Reduction Systems and Extensions: An Overview. - John R. W. Glauert; Delia Kesner; Zurab Khasidashvili (Processes, Terms and Cycles, 2005)

Extending the Explicit Substitution Paradigm. - Delia Kesner; Stéphane Lengrand (RTA, 2005)

de Bruijn Indices for Metaterms. - Eduardo Bonelli; Delia Kesner; Alejandro Ríos 001 (J. Log. Comput., 2005)

Relating Higher-order and First-order Rewriting. - Eduardo Bonelli; Delia Kesner; Alejandro Ríos 001 (J. Log. Comput., 2005)

Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic. - Roy Dyckhoff; Delia Kesner; Stéphane Lengrand (IJCAR, 2006)

Pure Pattern Calculus. - C. Barry Jay; Delia Kesner (ESOP, 2006)

The Theory of Calculi with Explicit Substitutions Revisited. - Delia Kesner (CSL, 2007)

Resource operators for lambda-calculus. - Delia Kesner; Stéphane Lengrand (Inf. Comput., 2007)

Expression Reduction Systems with Patterns. - Julien Forest; Delia Kesner (J. Autom. Reason., 2007)

Perpetuality for Full and Safe Composition (in a Constructive Setting). - Delia Kesner (ICALP (2), 2008)

The Prismoid of Resources. - Delia Kesner; Fabien Renaud (MFCS, 2009)

A Theory of Explicit Substitutions with Safe and Full Composition - Delia Kesner (Log. Methods Comput. Sci., 2009)

First-class patterns. - C. Barry Jay; Delia Kesner (J. Funct. Program., 2009)

The Structural lambda-Calculus. - Beniamino Accattoli; Delia Kesner (CSL, 2010)

A standardisation proof for algebraic pattern calculi - Delia Kesner; Carlos Lombardi; Alejandro Ríos 001 (HOR, 2010)

A prismoid framework for languages with resources. - Delia Kesner; Fabien Renaud (Theor. Comput. Sci., 2011)

The Permutative λ-Calculus. - Beniamino Accattoli; Delia Kesner (LPAR, 2012)

Normalisation for Dynamic Pattern Calculi. - Eduardo Bonelli; Delia Kesner; Carlos Lombardi; Alejandro Ríos 001 (RTA, 2012)

Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus - Beniamino Accattoli; Delia Kesner (Log. Methods Comput. Sci., 2012)

Metaconfluence of Calculi with Explicit Substitutions at a Distance. - Flávio L. C. de Moura; Delia Kesner; Mauricio Ayala-Rincón (FSTTCS, 2014)

The Inhabitation Problem for Non-idempotent Intersection Types. - Antonio Bucciarelli; Delia Kesner; Simona Ronchi Della Rocca (IFIP TCS, 2014)

Quantitative Types for the Linear Substitution Calculus. - Delia Kesner; Daniel Ventura (IFIP TCS, 2014)

A nonstandard standardization theorem. - Beniamino Accattoli; Eduardo Bonelli; Delia Kesner; Carlos Lombardi (POPL, 2014)

An abstract normalisation result with applications to non-sequential calculi. - Eduardo Bonelli; Delia Kesner; Carlos Lombardi; Alejandro Ríos 001 (CoRR, 2014)

A Resource Aware Computational Interpretation for Herbelin's Syntax. - Delia Kesner; Daniel Ventura (ICTAC, 2015)

Observability for Pair Pattern Calculi. - Antonio Bucciarelli; Delia Kesner; Simona Ronchi Della Rocca (TLCA, 2015)

Strong Normalization through Intersection Types and Memory. - Antonio Bucciarelli; Delia Kesner; Daniel Ventura (LSFA, 2015)

Special Issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). - Marcelo Finger; Delia Kesner (Theor. Comput. Sci., 2015)

Reasoning About Call-by-need by Means of Types. - Delia Kesner (FoSSaCS, 2016)

Types as Resources for Classical Natural Deduction. - Delia Kesner; Pierre Vial (FSCD, 2017)

Non-idempotent intersection types for the Lambda-Calculus. - Antonio Bucciarelli; Delia Kesner; Daniel Ventura (Log. J. IGPL, 2017)

Foundations of strong call by need. - Thibaut Balabonski; Pablo Barenbaum; Eduardo Bonelli; Delia Kesner (Proc. ACM Program. Lang., 2017)

On abstract normalisation beyond neededness. - Eduardo Bonelli; Delia Kesner; Carlos Lombardi; Alejandro Ríos 001 (Theor. Comput. Sci., 2017)

Call-by-Need, Neededness and All That. - Delia Kesner; Alejandro Ríos 001; Andrés Viso (FoSSaCS, 2018)

Observability = Typability + Inhabitation. - Antonio Bucciarelli; Delia Kesner; Simona Ronchi Della Rocca (CoRR, 2018)

Inhabitation for Non-idempotent Intersection Types. - Antonio Bucciarelli; Delia Kesner; Simona Ronchi Della Rocca (Log. Methods Comput. Sci., 2018)

Tight typings and split bounds. - Beniamino Accattoli; Stéphane Graham-Lengrand; Delia Kesner (Proc. ACM Program. Lang., 2018)

A Quantitative Understanding of Pattern Matching. - Sandra Alves; Delia Kesner; Daniel Ventura (TYPES, 2019)

Strong Bisimulation for Control Operators. - Eduardo Bonelli; Delia Kesner; Andrés Viso (CoRR, 2019)

A resource aware semantics for a focused intuitionistic calculus. - Delia Kesner; Daniel Ventura (Math. Struct. Comput. Sci., 2019)

Strong Bisimulation for Control Operators (Invited Talk). - Delia Kesner; Eduardo Bonelli; Andrés Viso (CSL, 2020)

Consuming and Persistent Types for Classical Logic. - Delia Kesner; Pierre Vial (LICS, 2020)

Tight typings and split bounds, fully developed. - Beniamino Accattoli; Stéphane Graham-Lengrand; Delia Kesner (J. Funct. Program., 2020)

Non-idempotent types for classical calculi in natural deduction style. - Delia Kesner; Pierre Vial (Log. Methods Comput. Sci., 2020)

The Spirit of Node Replication. - Delia Kesner; Loïc Peyrot; Daniel Ventura (FoSSaCS, 2021)

A Strong Bisimulation for Control Operators by Means of Multiplicative and Exponential Reduction. - Eduardo Bonelli; Delia Kesner; Andrés Viso (CoRR, 2021)

The Power of Tightness for Call-By-Push-Value. - Delia Kesner; Andrés Viso (CoRR, 2021)

Solvability = Typability + Inhabitation. - Antonio Bucciarelli; Delia Kesner; Simona Ronchi Della Rocca (Log. Methods Comput. Sci., 2021)

Encoding Tight Typing in a Unified Framework. - Delia Kesner; Andrés Viso (CSL, 2022)

A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications. - José Espírito Santo; Delia Kesner; Loïc Peyrot (FoSSaCS, 2022)

Solvability for Generalized Applications. - Delia Kesner; Loïc Peyrot (FSCD, 2022)

A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications (Long Version). - José Espírito Santo; Delia Kesner; Loïc Peyrot (CoRR, 2022)

A fine-grained computational interpretation of Girard's intuitionistic proof-nets. - Delia Kesner (Proc. ACM Program. Lang., 2022)

Quantitative Global Memory. - Sandra Alves; Delia Kesner; Miguel Ramos 002 (WoLLIC, 2023)

Milner's Lambda-Calculus with Partial Substitutions. - Delia Kesner; Shane Ó Conchúir (CoRR, 2023)

Quantitative Inhabitation for Different Lambda Calculi in a Unifying Framework. - Victor Arrial; Giulio Guerrieri; Delia Kesner (Proc. ACM Program. Lang., 2023)

The bang calculus revisited. - Antonio Bucciarelli; Delia Kesner; Alejandro Ríos 001; Andrés Viso (Inf. Comput., 2023)

Extending the Quantitative Pattern-Matching Paradigm. - Sandra Alves; Delia Kesner; Miguel Ramos 002 (APLAS, 2024)

The Ackermann Award 2023. - Maribel Fernández; Jean Goubault-Larrecq; Delia Kesner (CSL, 2024)

Meaningfulness and Genericity in a Subsuming Framework (Invited Talk). - Delia Kesner; Victor Arrial; Giulio Guerrieri (FSCD, 2024)

The Benefits of Diligence. - Victor Arrial; Giulio Guerrieri; Delia Kesner (IJCAR (2), 2024)

Genericity Through Stratification. - Victor Arrial; Giulio Guerrieri; Delia Kesner (LICS, 2024)

Hybrid Intersection Types for PCF. - Pablo Barenbaum; Delia Kesner; Mariana Milicich (LPAR, 2024)

Meaningfulness and Genericity in a Subsuming Framework. - Delia Kesner; Victor Arrial; Giulio Guerrieri (CoRR, 2024)

Hybrid Intersection Types for PCF (Extended Version). - Pablo Barenbaum; Delia Kesner; Mariana Milicich (CoRR, 2024)

The Essense of Useful Evaluation Through Quantitative Types (Extended Version). - Pablo Barenbaum; Delia Kesner; Mariana Milicich (CoRR, 2024)

A Strong Bisimulation for a Classical Term Calculus. - Eduardo Bonelli; Delia Kesner; Andrés Viso (Log. Methods Comput. Sci., 2024)

Node Replication: Theory And Practice. - Delia Kesner; Loïc Peyrot; Daniel Ventura (Log. Methods Comput. Sci., 2024)

A Faithful and Quantitative Notion of Distant Reduction for the Lambda-Calculus with Generalized Applications. - José Espírito Santo; Delia Kesner; Loïc Peyrot (Log. Methods Comput. Sci., 2024)

A Fresh Inductive Approach to Useful Call-by-Value. - Pablo Barenbaum; Delia Kesner; Mariana Milicich (CADE, 2025)