- Extending the explicit substitution paradigm Delia Kesner 1 and Stephane Lengrand 1,2
- Milner's Lambda-Calculus with Partial Substitutions Delia Kesner1
- To appear in Math. Struct. in Comp. Science Proof Nets and Explicit Substitutions
- calculi with explicit substitutions and composition which preserve fistrong normalization (Extended
- Rewriting with Extensional Polymorphic Roberto Di Cosmo 1 and Delia Kesner 2
- Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets
- A de Bruijn notation for higherorder rewriting Eduardo Bonelli 1;2 , Delia Kesner 2 , Alejandro R'ios 1
- calculi with explicit substitutions and weak composition which preserve fistrong normalization
- Expression Reduction Systems with Patterns Julien Forest 1 and Delia Kesner 2
- Reasoning about Layered, Wildcard and Product Patterns Delia Kesner
- The structural -calculus Beniamino Accattoli and Delia Kesner
- The Prismoid of Resources Delia Kesner and Fabien Renaud
- The theory of calculi with explicit substitutions revisited Delia Kesner
- Pure pattern calculus Barry Jay 1 and Delia Kesner 2
- From HigherOrder to FirstOrder Rewriting Eduardo Bonelli 1;2 , Delia Kesner 2 , Alejandro R'ios 1
- Pattern Matching as Cut Elimination Serenella Cerrito Delia Kesner
- Free Sequentiality in Orthogonal OrderSorted Rewriting Systems with Constructors
- A Typed Pattern Calculus Delia Kesner \Lambda Laurence Puel \Lambda Val Tannen z
- Expression Reduction Systems with Patterns Julien Forest 1 and Delia Kesner 2
- Math. Struct. in Comp. Science (1993), vol. 11, pp. 1--000 Copyright c fl Cambridge University Press
- From HigherOrder to FirstOrder Rewriting (Extended Abstract)
- A de Bruijn notation for higherorder rewriting (Extended Abstract)
- Combining algebraic rewriting, extensional lambda calculi, and Roberto Di Cosmo # Delia Kesner
- Perpetuality for full and safe composition (in a constructive setting)
- A confluent reduction for the extensional typed \Gammacalculus with pairs, sums, recursion and terminal object
- Strong cutelimination systems for Hudelmaier's depthbounded sequent calculus
- Confluence of Extensional and NonExtensional calculi with Explicit Substitutions
- Reducing ACTermination to Termination Maria C. F. Ferreira \Lambda Delia Kesner z Laurence Puel z
- Resource operators for #calculus Delia Kesner 1 and Stephane Lengrand 1,2
- Pattern Matching as Cut Elimination Serenella Cerrito \Lambda Delia Kesner \Lambda
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
- Confluence Properties of Extensional and NonExtensional #Calculi with Explicit Substitutions
