| 2009 |
|---|
| 38 | EE | C. Barry Jay,
Delia Kesner:
First-class patterns.
J. Funct. Program. 19(2): 191-225 (2009) |
| 2008 |
|---|
| 37 | EE | Delia Kesner:
Perpetuality for Full and Safe Composition (in a Constructive Setting).
ICALP (2) 2008: 311-322 |
| 2007 |
|---|
| 36 | EE | Delia Kesner:
The Theory of Calculi with Explicit Substitutions Revisited.
CSL 2007: 238-252 |
| 35 | EE | Delia Kesner,
Stéphane Lengrand:
Resource operators for lambda-calculus.
Inf. Comput. 205(4): 419-473 (2007) |
| 34 | EE | Julien Forest,
Delia Kesner:
Expression Reduction Systems with Patterns.
J. Autom. Reasoning 39(4): 513-541 (2007) |
| 2006 |
|---|
| 33 | EE | C. Barry Jay,
Delia Kesner:
Pure Pattern Calculus.
ESOP 2006: 100-114 |
| 32 | EE | Roy Dyckhoff,
Delia Kesner,
Stéphane Lengrand:
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic.
IJCAR 2006: 347-361 |
| 2005 |
|---|
| 31 | EE | John J. Glauert,
Delia Kesner,
Zurab Khasidashvili:
Expression Reduction Systems and Extensions: An Overview.
Processes, Terms and Cycles 2005: 496-553 |
| 30 | EE | Delia Kesner,
Stéphane Lengrand:
Extending the Explicit Substitution Paradigm.
RTA 2005: 407-422 |
| 29 | EE | Eduardo Bonelli,
Delia Kesner,
Alejandro Ríos:
de Bruijn Indices for Metaterms.
J. Log. Comput. 15(6): 855-899 (2005) |
| 28 | EE | Eduardo Bonelli,
Delia Kesner,
Alejandro Ríos:
Relating Higher-order and First-order Rewriting.
J. Log. Comput. 15(6): 901-947 (2005) |
| 2004 |
|---|
| 27 | EE | Serenella Cerrito,
Delia Kesner:
Pattern matching as cut elimination.
Theor. Comput. Sci. 323(1-3): 71-127 (2004) |
| 2003 |
|---|
| 26 | EE | Julien Forest,
Delia Kesner:
Expression Reduction Systems with Patterns.
RTA 2003: 107-122 |
| 25 | | Roberto Di Cosmo,
Delia Kesner,
Emmanuel Polonovski:
Proof Nets And Explicit Substitutions.
Mathematical Structures in Computer Science 13(3): 409-450 (2003) |
| 2001 |
|---|
| 24 | EE | Eduardo Bonelli,
Delia Kesner,
Alejandro Ríos:
From Higher-Order to First-Order Rewriting.
RTA 2001: 47-62 |
| 23 | | Delia Kesner:
Theory and applications of explicit substitutions: Introduction.
Mathematical Structures in Computer Science 11(1): 1 (2001) |
| 2000 |
|---|
| 22 | EE | Roberto Di Cosmo,
Delia Kesner,
Emmanuel Polonovski:
Proof Nets and Explicit Substitutions.
FoSSaCS 2000: 63-81 |
| 21 | | Eduardo Bonelli,
Delia Kesner,
Alejandro Ríos:
A de Bruijn Notation for Higher-Order Rewriting.
RTA 2000: 62-79 |
| 20 | EE | Delia Kesner:
Confluence of extensional and non-extensional lambda-calculi with explicit substitutions.
Theor. Comput. Sci. 238(1-2): 183-220 (2000) |
| 1999 |
|---|
| 19 | EE | Serenella Cerrito,
Delia Kesner:
Pattern Matching as Cut Elimination.
LICS 1999: 98-108 |
| 18 | EE | Maria C. F. Ferreira,
Delia Kesner,
Laurence Puel:
lambda-Calculi with Explicit Substitutions Preserving Strong Normalization.
Appl. Algebra Eng. Commun. Comput. 9(4): 333-371 (1999) |
| 17 | | Delia Kesner,
Pablo E. Martínez López:
Explicit Substitutions for Objects and Functions
Journal of Functional and Logic Programming 1999(Special Issue 2): (1999) |
| 1998 |
|---|
| 16 | EE | Maria C. F. Ferreira,
Delia Kesner,
Laurence Puel:
Reducing AC-Termination to Termination.
MFCS 1998: 239-247 |
| 15 | EE | Delia Kesner,
Pablo E. Martínez López:
Explicit Substitutions for Objects and Functions.
PLILP/ALP 1998: 195-212 |
| 1997 |
|---|
| 14 | EE | Roberto Di Cosmo,
Delia Kesner:
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract).
LICS 1997: 35-46 |
| 13 | | Delia Kesner:
Reasoning about Redundant Patterns.
Journal of Functional and Logic Programming 1997(4): (1997) |
| 1996 |
|---|
| 12 | | Maria C. F. Ferreira,
Delia Kesner,
Laurence Puel:
Lambda-Calculi with Explicit Substitutions and Composition Which Preserve Beta-Strong Normalization.
ALP 1996: 284-298 |
| 11 | | Delia Kesner:
Confluence Properties of Extensional and Non-Extensional lambda-Calculi with Explicit Substitutions (Extended Abstract).
RTA 1996: 184-199 |
| 10 | | Delia Kesner,
Laurence Puel,
Val Tannen:
A Typed Pattern Calculus.
Inf. Comput. 124(1): 32-61 (1996) |
| 9 | EE | Roberto Di Cosmo,
Delia Kesner:
Combining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints.
Theor. Comput. Sci. 169(2): 201-220 (1996) |
| 1995 |
|---|
| 8 | | Roberto Di Cosmo,
Delia Kesner:
Rewriting with Extensional Polymorphic Lambda-Calculus.
CSL 1995: 215-232 |
| 1994 |
|---|
| 7 | | Delia Kesner:
Reasoning about Layered, Wildcard and Product Patterns.
ALP 1994: 253-268 |
| 6 | | Roberto Di Cosmo,
Delia Kesner:
Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi.
ICALP 1994: 462-472 |
| 5 | | Roberto Di Cosmo,
Delia Kesner:
Simulating Expansions without Expansions.
Mathematical Structures in Computer Science 4(3): 315-362 (1994) |
| 1993 |
|---|
| 4 | | Roberto Di Cosmo,
Delia Kesner:
A Confluent Reduction for the Extensional Typed lambda-Calculus with Pairs, Sums, Recursion and terminal Object.
ICALP 1993: 645-656 |
| 3 | | Val Tannen,
Delia Kesner,
Laurence Puel:
A Typed Pattern Calculus
LICS 1993: 262-274 |
| 1992 |
|---|
| 2 | | Delia Kesner:
Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors.
CADE 1992: 603-617 |
| 1991 |
|---|
| 1 | | Delia Kesner:
Pattern Matching in Order-Sorted Languages.
MFCS 1991: 267-276 |
