BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Czech Republic
1 × Iceland
1 × Israel
1 × Sweden
1 × Switzerland
1 × The Netherlands
1 × United Kingdom
2 × Germany
2 × Italy
2 × Japan
2 × Poland
2 × Spain
4 × USA
Collaborated with:
R.D.Cosmo E.Bonelli A.Ríos S.Lengrand B.Accattoli C.Lombardi C.B.Jay J.Forest S.Cerrito P.E.M.López A.Bucciarelli S.R.D.Rocca R.Dyckhoff E.Polonowski M.C.F.Ferreira L.Puel A.Viso
Talks about:
substitut (7) explicit (7) pattern (6) calculi (6) order (5) extension (4) calculus (4) system (4) strong (4) rewrit (4)

Person: Delia Kesner

DBLP DBLP: Kesner:Delia

Contributed to:

TLCA 20152015
POPL 20142014
RTA 20122012
CSL 20102010
ICALP (2) 20082008
CSL 20072007
ESOP 20062006
IJCAR 20062006
RTA 20052005
RTA 20032003
RTA 20012001
FoSSaCS 20002000
RTA 20002000
LICS 19991999
ALP/PLILP 19981998
LICS 19971997
ALP 19961996
RTA 19961996
ALP 19941994
ICALP 19941994
ICALP 19931993
CADE 19921992
CSL 20202020

Wrote 23 papers:

TLCA-2015-BucciarelliKR #calculus
Observability for Pair Pattern Calculi (AB, DK, SRDR), pp. 123–137.
POPL-2014-AccattoliBKL #standard #theorem
A nonstandard standardization theorem (BA, EB, DK, CL), pp. 659–670.
RTA-2012-BonelliKLR #calculus #normalisation
Normalisation for Dynamic Pattern Calculi (EB, DK, CL, AR), pp. 117–132.
CSL-2010-AccattoliK #λ-calculus
The Structural λ-Calculus (BA, DK), pp. 381–395.
ICALP-B-2008-Kesner #composition
Perpetuality for Full and Safe Composition (in a Constructive Setting) (DK), pp. 311–322.
CSL-2007-Kesner #calculus #formal method #revisited
The Theory of Calculi with Explicit Substitutions Revisited (DK), pp. 238–252.
ESOP-2006-JayK #calculus
Pure Pattern Calculus (CBJ, DK), pp. 100–114.
IJCAR-2006-DyckhoffKL #bound #calculus #logic
Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic (RD, DK, SL), pp. 347–361.
RTA-2005-KesnerL #paradigm
Extending the Explicit Substitution Paradigm (DK, SL), pp. 407–422.
RTA-2003-ForestK #reduction
Expression Reduction Systems with Patterns (JF, DK), pp. 107–122.
RTA-2001-BonelliKR #first-order #higher-order
From Higher-Order to First-Order Rewriting (EB, DK, AR), pp. 47–62.
FoSSaCS-2000-CosmoKP #proving
Proof Nets and Explicit Substitutions (RDC, DK, EP), pp. 63–81.
RTA-2000-BonelliKR #higher-order
A de Bruijn Notation for Higher-Order Rewriting (EB, DK, AR), pp. 62–79.
LICS-1999-CerritoaK #pattern matching
Pattern Matching as Cut Elimination (SC, DK), pp. 98–108.
Explicit Substitutions for Objects and Functions (DK, PEML), pp. 195–212.
LICS-1997-CosmoK #normalisation #proving
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (RDC, DK), pp. 35–46.
ALP-1996-FerreiraKP #composition #normalisation #λ-calculus
λ-Calculi with Explicit Substitutions and Composition Which Preserve β-Strong Normalization (MCFF, DK, LP), pp. 284–298.
RTA-1996-Kesner #confluence #λ-calculus
Confluence Properties of Extensional and Non-Extensional λ-Calculi with Explicit Substitutions (DK), pp. 184–199.
ALP-1994-Kesner #reasoning
Reasoning about Layered, Wildcard and Product Patterns (DK), pp. 253–268.
ICALP-1994-CosmoK #algebra #first-order #recursion #term rewriting #λ-calculus
Combining First Order Algebraic Rewriting Systems, Recursion and Extensional λ Calculi (RDC, DK), pp. 462–472.
ICALP-1993-CosmoK #confluence #recursion #reduction #λ-calculus
A Confluent Reduction for the Extensional Typed λ-Calculus with Pairs, Sums, Recursion and terminal Object (RDC, DK), pp. 645–656.
CADE-1992-Kesner #order #orthogonal #term rewriting
Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors (DK), pp. 603–617.
CSL-2020-KesnerBV #bisimulation
Strong Bisimulation for Control Operators (Invited Talk) (DK, EB, AV), p. 23.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.