Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Delia Kesner
2010 – today
- 2012
[j18]Beniamino Accattoli, Delia Kesner: Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus. Logical Methods in Computer Science 8(1) (2012)- [c28]
- [c27]Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos: Normalisation for Dynamic Pattern Calculi. RTA 2012: 117-132
- [e1]Delia Kesner, Petrucio Viana (Eds.): Proceedings Seventh Workshop on Logical and Semantic Frameworks, with Applications. EPTCS 113, 2012
- 2011
- [j17]Delia Kesner, Fabien Renaud: A prismoid framework for languages with resources. Theor. Comput. Sci. 412(37): 4867-4892 (2011)
- 2010
- [c26]
- [c25]Delia Kesner, Carlos Lombardi, Alejandro Ríos: A standardisation proof for algebraic pattern calculi. HOR 2010: 58-72
2000 – 2009
- 2009
- [j16]Delia Kesner: A Theory of Explicit Substitutions with Safe and Full Composition. Logical Methods in Computer Science 5(3) (2009)
- [j15]
- [c24]
- 2008
- [c23]Delia Kesner: Perpetuality for Full and Safe Composition (in a Constructive Setting). ICALP (2) 2008: 311-322
- 2007
- [j14]Delia Kesner, Stéphane Lengrand: Resource operators for lambda-calculus. Inf. Comput. 205(4): 419-473 (2007)
- [j13]Julien Forest, Delia Kesner: Expression Reduction Systems with Patterns. J. Autom. Reasoning 39(4): 513-541 (2007)
- [c22]
- 2006
- [c21]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
- [c20]
- 2005
- [j12]Eduardo Bonelli, Delia Kesner, Alejandro Ríos: de Bruijn Indices for Metaterms. J. Log. Comput. 15(6): 855-899 (2005)
- [j11]Eduardo Bonelli, Delia Kesner, Alejandro Ríos: Relating Higher-order and First-order Rewriting. J. Log. Comput. 15(6): 901-947 (2005)
- [c19]John R. W. Glauert, Delia Kesner, Zurab Khasidashvili: Expression Reduction Systems and Extensions: An Overview. Processes, Terms and Cycles 2005: 496-553
- [c18]
- 2004
- [j10]Serenella Cerrito, Delia Kesner: Pattern matching as cut elimination. Theor. Comput. Sci. 323(1-3): 71-127 (2004)
- 2003
- [j9]Roberto Di Cosmo, Delia Kesner, Emmanuel Polonowski: Proof Nets And Explicit Substitutions. Mathematical Structures in Computer Science 13(3): 409-450 (2003)
- [c17]
- 2001
- [j8]Delia Kesner: Theory and applications of explicit substitutions: Introduction. Mathematical Structures in Computer Science 11(1): 1 (2001)
- [c16]Eduardo Bonelli, Delia Kesner, Alejandro Ríos: From Higher-Order to First-Order Rewriting. RTA 2001: 47-62
- 2000
- [j7]Delia Kesner: Confluence of extensional and non-extensional lambda-calculi with explicit substitutions. Theor. Comput. Sci. 238(1-2): 183-220 (2000)
- [c15]Roberto Di Cosmo, Delia Kesner, Emmanuel Polonowski: Proof Nets and Explicit Substitutions. FoSSaCS 2000: 63-81
- [c14]Eduardo Bonelli, Delia Kesner, Alejandro Ríos: A de Bruijn Notation for Higher-Order Rewriting. RTA 2000: 62-79
1990 – 1999
- 1999
- [j6]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)
- [j5]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)
- [c13]
- 1998
- [c12]Maria C. F. Ferreira, Delia Kesner, Laurence Puel: Reducing AC-Termination to Termination. MFCS 1998: 239-247
- [c11]Delia Kesner, Pablo E. Martínez López: Explicit Substitutions for Objects and Functions. PLILP/ALP 1998: 195-212
- 1997
- [j4]Delia Kesner: Reasoning about Redundant Patterns. Journal of Functional and Logic Programming 1997(4) (1997)
- [c10]Roberto Di Cosmo, Delia Kesner: Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract). LICS 1997: 35-46
- 1996
- [j3]Delia Kesner, Laurence Puel, Val Tannen: A Typed Pattern Calculus. Inf. Comput. 124(1): 32-61 (1996)
- [j2]Roberto Di Cosmo, Delia Kesner: Combining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints. Theor. Comput. Sci. 169(2): 201-220 (1996)
- [c9]Maria C. F. Ferreira, Delia Kesner, Laurence Puel: Lambda-Calculi with Explicit Substitutions and Composition Which Preserve Beta-Strong Normalization. ALP 1996: 284-298
- [c8]Delia Kesner: Confluence Properties of Extensional and Non-Extensional lambda-Calculi with Explicit Substitutions (Extended Abstract). RTA 1996: 184-199
- 1995
- [c7]Roberto Di Cosmo, Delia Kesner: Rewriting with Extensional Polymorphic Lambda-Calculus. CSL 1995: 215-232
- 1994
- [j1]Roberto Di Cosmo, Delia Kesner: Simulating Expansions without Expansions. Mathematical Structures in Computer Science 4(3): 315-362 (1994)
- [c6]
- [c5]Roberto Di Cosmo, Delia Kesner: Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi. ICALP 1994: 462-472
- 1993
- [c4]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
- [c3]
- 1992
- [c2]Delia Kesner: Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors. CADE 1992: 603-617
- 1991
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:01 CEST by the dblp team