Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Kesner, Delia"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Metaconfluence of calculi with explicit substitutions at a distance
Flávio L.C. de Moura
,
Delia Kesner
,
Mauricio Ayala-Rincón
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 391-402
A prismoid framework for languages with resources
Delia Kesner
,
Fabien Renaud
Theoretical Computer Science
412
(37), 2011, pp. 4867-4892
The prismoid of resources
Delia Kesner
,
Fabien Renaud
Lecture Notes in Computer Science
5734
, 2009, pp. 464-476
Perpetuality for full and safe composition (in a constructive setting)
Delia Kesner
Lecture Notes in Computer Science
5126
, 2008, pp. 311-322
Resource operators for
\lambda
-calculus
Delia Kesner
,
Steṕhane Lengrand
Information and Computation
205
(4), 2007, pp. 419-473
Pattern matching as cut elimination
Serenella Cerrito
,
Delia Kesner
Theoretical Computer Science
323
(1-3), 2004, pp. 71-127
Confluence of extensional and non-extensional
\lambda
-calculi with explicit substitutions
Delia Kesner
Theoretical Computer Science
238
(1-2), 2000, pp. 183-220
Reducing AC-termination to termination
Maria C.F. Ferreira
,
Delia Kesner
,
Laurence Puel
Lecture Notes in Computer Science
1450
, 1998, pp. 239-247
Combining algebraic rewriting, extensional lambda calculi, and fixpoints
Roberto Di Cosmo
,
Delia Kesner
Theoretical Computer Science
169
(2), 1996, pp. 201-220
A typed pattern calculus
Delia Kesner
,
Laurence Puel
,
Val Tannen
Information and Computation
124
(1), 1996, pp. 32-61
Combining first order algebraic rewriting systems, recursion and extensional lambda calculi
Roberto di Cosmo
,
Delia Kesner
Lecture Notes in Computer Science
820
, 1994, pp. 462-472
A confluent reduction for the extensional typed
\lambda
-calculus with pairs, sums, recursion and terminal object
Roberto di Cosmo
,
Delia Kesner
Lecture Notes in Computer Science
700
, 1993, pp. 645-656
Pattern matching in order-sorted languages
Delia Kesner
Lecture Notes in Computer Science
520
, 1991, pp. 267-276