Proceedings of the 14th International
Conference on Rewriting Techniques and Applications (RTA)
LNCS 2706, pages 107-122, Valencia, Spain, June 2003.
Long version (ps file)
Proceedings of the 12th International
Conference on Rewriting Techniques and Applications (RTA)
LNCS 2051, pages 47--62, Utrecht, The Netherlands, June 2001.
A revised version will appear as:
Relating Higher-Order and First-Order Rewriting
Eduardo Bonelli and Delia Kesner and
Alejandro Ríos
Journal of Logic and Computation. To appear.
Long version (ps file)
Proceedings of the 11th International
Conference on Rewriting Techniques and Applications (RTA)
LNCS 1833, pages 62--79, Norwick, UK, July 2000.
A revised version will appear as:
de Bruijn Indices for MetaTerms
Eduardo Bonelli and Delia Kesner and
Alejandro Ríos
Journal of Logic and Computation. To appear.
Short version(ps file)© Springer-Verlag Long version (ps file)
Foundations of Software Science and Computation Structures (FOSSACS)
LNCS 1784, pages 63--81, Berlin, Germany, March/April, 2000.
A revised version appears as:
Proof Nets and Explicit Substitutions
Roberto Di Cosmo and Delia Kesner and Emmanuel Polonovski
Mathematical Structures in Computer Science
Volume 13, Number 3, pages 409-450, 2003.
Long Version (ps file)
Proceedings of the 14th Annual IEEE Symposium on Logic
in Computer Science (LICS)
pages 98-108, Trento, Italy, July 1999.
A revised version appears as:
Pattern Matching as Cut Elimination
Serenella Cerrito and Delia Kesner
Theoretical Computer Science
Volume 323, pages 71-127, 2004.
Short Version(ps file) Long Version(ps file)
Proceedings of the Joint International Symposiums
Programming Languages, Implementations, Logics and Program (PLILP) and
Algebraic and Logic Programming (ALP)
LNCS 1490, pages 195-212, Pisa, Italy, September 1998.
A revised version appears as:
Explicit Substitutions for Objects and Functions
Delia Kesner and Pablo E. Martínez López
The Journal of Functional and Logic Programming
Published by The MIT Press
Volume 1999
Special Issue 2
Long Version (ps file)
Proceedings of the 23rd International Symposium on Mathematical
Foundations of Computer Science (MFCS)
LNCS 1450, pages 239-247, Brno, Czech Republic, August 1998.
Long version (ps file)
Proceedings of the 12th Annual IEEE Symposium on Logic
in Computer Science (LICS)
pages 35-45, Warsaw, Poland, July 1997.
Short Version (ps file)
Proceedings of the 5th International Conference on Algebraic
and Logic Programming (ALP)
LNCS 1139, pages 284-298, Aachen, Germany, September 1996.
A revised version appears as:
Lambda-calculi with Explicit Substitutions Preserving Strong Normalization
Maria C. F. Ferreira and Delia Kesner and Laurence Puel
Applicable Algebra in Engineering, Communication and Computing
Volume 9, number 4, pages 333-371, March 1999.
Short Version(ps file)© Springer-Verlag Long Version (ps file)
Proceedings of the 7th International
Conference on Rewriting Techniques and Applications (RTA)
LNCS 1103, pages 184-199,
New Brunswick, NJ, USA, July 1996.
A revised version appears as:
Confluence of Extensional and Non-Extensional
lambda-calculi with Explicit Substitutions
Delia Kesner
Theoretical Computer Science
Volume 238, number 1-2, pages 183-220, 2000.
Short version (ps file)© Springer-Verlag Long version (ps file)
Proceedings of the 9th International Workshop on
Computer Science Logic (CSL)
LNCS 1092, pages 215-232,
Paderborn, Germany, September 1995.
(ps file)© Springer-Verlag
Proceedings of the 21st International Colloquium on
Automata, Languages and Programming (ICALP)
LNCS 820, pages 462-472,
Jerusalem, Israel, July 1994.
A revised version appears as:
Combining algebraic rewriting systems,
extensional lambda-calculi and fixpoints
Roberto Di Cosmo and Delia Kesner
Theoretical Computer Science
Volume 169, pages 201-220, 1996.
Short version (ps file)© Springer-Verlag Long version (ps file)
An extended abstract can be found as:
A typed pattern calculus
Val Breazu-Tannen and Delia Kesner and Laurence Puel
Proceedings of the 8th Annual IEEE Symposium on Logic
in Computer Science (LICS)
pages 262-274, Montreal, Canada, June 1993.
A revised version can be found as:
Information and Computation
Volume 124, number 1, January 1995.
Long version (ps file)
Proceedings of the 20st International Colloquium on
Automata, Languages and Programming (ICALP)
LNCS 700, pages 645-656,
Lund, Sweden, July 1993.
A revised version appears as:
Simulating expansions without expansions
Roberto Di Cosmo and Delia Kesner
Mathematical Structures in Computer Science
Volume 4, pages 315-362, 1994.
Short Version (ps file)© Springer-Verlag Long version(ps file)
Proceedings of the 4th International Conference on Algebraic
and Logic Programming (ALP)
LNCS 850, pages 253-268,
Madrid, Spain, September 1994.
A revised version appears as:
Reasoning about redundant patterns
Delia Kesner
Journal of Functional and Logic Programming
1997
Short version ( ps file)© Springer-Verlag Long version (ps file)
Proceedings of the 11th International Conference on Automated
Deduction (CADE)
LNAI 607, pages 603-617,
Saratoga Springs, NY, USA, June 1992.
( ps file)© Springer-Verlag
Proceedings of the 16th International Symposium on Mathematical
Foundations of Computer Science (MFCS)
LNCS 520, pages 267-276,
Kazimierz Dolny, Poland, September 1991.