default search action
Delia Kesner
Person information
- affiliation: University Paris-Diderot, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j34]Delia Kesner, Loïc Peyrot
, Daniel Ventura:
Node Replication: Theory And Practice. Log. Methods Comput. Sci. 20(1) (2024) - [j33]Eduardo Bonelli, Delia Kesner, Andrés Viso:
A Strong Bisimulation for a Classical Term Calculus. Log. Methods Comput. Sci. 20(2) (2024) - [j32]José Espírito Santo, Delia Kesner, Loïc Peyrot:
A Faithful and Quantitative Notion of Distant Reduction for the Lambda-Calculus with Generalized Applications. Log. Methods Comput. Sci. 20(3) (2024) - [c53]Sandra Alves, Delia Kesner, Miguel Ramos:
Extending the Quantitative Pattern-Matching Paradigm. APLAS 2024: 84-105 - [c52]Maribel Fernández, Jean Goubault-Larrecq, Delia Kesner:
The Ackermann Award 2023. CSL 2024: 1:1-1:4 - [c51]Delia Kesner, Victor Arrial, Giulio Guerrieri:
Meaningfulness and Genericity in a Subsuming Framework (Invited Talk). FSCD 2024: 1:1-1:24 - [c50]Victor Arrial
The Benefits of Diligence. IJCAR (2) 2024: 338-359 - [c49]Victor Arrial
Genericity Through Stratification. LICS 2024: 5:1-5:15 - [c48]Pablo Barenbaum, Delia Kesner, Mariana Milicich:
Hybrid Intersection Types for PCF. LPAR 2024: 181-197 - [e4]Delia Kesner
29th International Conference on Types for Proofs and Programs, TYPES 2023, June 12-16, 2023, ETSInf, Universitat Politècnica de València, Spain. LIPIcs 303, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-332-4 [contents] - [i21]Victor Arrial, Giulio Guerrieri, Delia Kesner:
Genericity Through Stratification. CoRR abs/2401.12212 (2024) - [i20]Delia Kesner, Victor Arrial, Giulio Guerrieri:
Meaningfulness and Genericity in a Subsuming Framework. CoRR abs/2404.06361 (2024) - [i19]Victor Arrial, Giulio Guerrieri, Delia Kesner:
The Benefits of Diligence. CoRR abs/2404.12951 (2024) - [i18]Pablo Barenbaum, Delia Kesner, Mariana Milicich:
Hybrid Intersection Types for PCF (Extended Version). CoRR abs/2404.14340 (2024) - [i17]Pablo Barenbaum, Delia Kesner, Mariana Milicich:
The Essense of Useful Evaluation Through Quantitative Types (Extended Version). CoRR abs/2404.18874 (2024) - [i16]Sandra Alves, Delia Kesner, Miguel Ramos:
Extending the Quantitative Pattern-Matching Paradigm. CoRR abs/2408.11007 (2024) - 2023
- [j31]Antonio Bucciarelli, Delia Kesner
The bang calculus revisited. Inf. Comput. 293: 105047 (2023) - [j30]Victor Arrial
Quantitative Inhabitation for Different Lambda Calculi in a Unifying Framework. Proc. ACM Program. Lang. 7(POPL): 1483-1513 (2023) - [c47]Sandra Alves, Delia Kesner, Miguel Ramos:
Quantitative Global Memory. WoLLIC 2023: 53-68 - [e3]Delia Kesner
28th International Conference on Types for Proofs and Programs, TYPES 2022, June 20-25, 2022, LS2N, University of Nantes, France. LIPIcs 269, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-285-3 [contents] - [i15]Sandra Alves, Delia Kesner, Miguel Ramos:
Quantitative Global Memory. CoRR abs/2303.08940 (2023) - [i14]Delia Kesner, Shane Ó Conchúir:
Milner's Lambda-Calculus with Partial Substitutions. CoRR abs/2312.13270 (2023) - 2022
- [j29]Delia Kesner
A fine-grained computational interpretation of Girard's intuitionistic proof-nets. Proc. ACM Program. Lang. 6(POPL): 1-28 (2022) - [c46]Delia Kesner, Andrés Viso:
Encoding Tight Typing in a Unified Framework. CSL 2022: 27:1-27:20 - [c45]José Espírito Santo
A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications. FoSSaCS 2022: 285-304 - [c44]Delia Kesner, Loïc Peyrot
Solvability for Generalized Applications. FSCD 2022: 18:1-18:22 - [i13]José Espírito Santo, Delia Kesner, Loïc Peyrot:
A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications (Long Version). CoRR abs/2201.04156 (2022) - [i12]Delia Kesner, Loïc Peyrot, Daniel Ventura:
Node Replication: Theory And Practice. CoRR abs/2207.07143 (2022) - 2021
- [j28]Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca:
Solvability = Typability + Inhabitation. Log. Methods Comput. Sci. 17(1) (2021) - [c43]Delia Kesner
The Spirit of Node Replication. FoSSaCS 2021: 344-364 - [i11]Eduardo Bonelli, Delia Kesner, Andrés Viso:
A Strong Bisimulation for Control Operators by Means of Multiplicative and Exponential Reduction. CoRR abs/2101.05754 (2021) - [i10]Delia Kesner, Andrés Viso:
The Power of Tightness for Call-By-Push-Value. CoRR abs/2105.00564 (2021) - 2020
- [j27]Beniamino Accattoli
Tight typings and split bounds, fully developed. J. Funct. Program. 30: e14 (2020) - [j26]Delia Kesner, Pierre Vial:
Non-idempotent types for classical calculi in natural deduction style. Log. Methods Comput. Sci. 16(1) (2020) - [c42]Delia Kesner, Eduardo Bonelli, Andrés Viso
Strong Bisimulation for Control Operators (Invited Talk). CSL 2020: 4:1-4:23 - [c41]Antonio Bucciarelli, Delia Kesner, Alejandro Ríos, Andrés Viso
The Bang Calculus Revisited. FLOPS 2020: 13-32 - [c40]Delia Kesner, Pierre Vial:
Consuming and Persistent Types for Classical Logic. LICS 2020: 619-632 - [i9]Antonio Bucciarelli, Delia Kesner, Alejandro Ríos, Andrés Viso:
The Bang Calculus Revisited. CoRR abs/2002.04011 (2020)
2010 – 2019
- 2019
- [j25]Delia Kesner, Daniel Ventura
A resource aware semantics for a focused intuitionistic calculus. Math. Struct. Comput. Sci. 29(1): 93-126 (2019) - [c39]Sandra Alves, Delia Kesner, Daniel Ventura:
A Quantitative Understanding of Pattern Matching. TYPES 2019: 3:1-3:36 - [i8]Eduardo Bonelli, Delia Kesner, Andrés Viso:
Strong Bisimulation for Control Operators. CoRR abs/1906.09370 (2019) - [i7]Sandra Alves, Delia Kesner, Daniel Ventura:
A Quantitative Understanding of Pattern Matching. CoRR abs/1912.01914 (2019) - 2018
- [j24]Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca:
Inhabitation for Non-idempotent Intersection Types. Log. Methods Comput. Sci. 14(3) (2018) - [j23]Beniamino Accattoli, Stéphane Graham-Lengrand, Delia Kesner:
Tight typings and split bounds. Proc. ACM Program. Lang. 2(ICFP): 94:1-94:30 (2018) - [c38]Delia Kesner, Alejandro Ríos, Andrés Viso
Call-by-Need, Neededness and All That. FoSSaCS 2018: 241-257 - [i6]Delia Kesner, Alejandro Ríos, Andrés Viso:
Call-by-need, neededness and all that. CoRR abs/1801.10519 (2018) - [i5]Delia Kesner, Pierre Vial:
Non-idempotent types for classical calculi in natural deduction style. CoRR abs/1802.05494 (2018) - [i4]Beniamino Accattoli, Stéphane Graham-Lengrand, Delia Kesner:
Tight Typings and Split Bounds. CoRR abs/1807.02358 (2018) - [i3]Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca:
Observability = Typability + Inhabitation. CoRR abs/1812.06009 (2018) - 2017
- [j22]Antonio Bucciarelli, Delia Kesner, Daniel Ventura
Non-idempotent intersection types for the Lambda-Calculus. Log. J. IGPL 25(4): 431-464 (2017) - [j21]Thibaut Balabonski, Pablo Barenbaum, Eduardo Bonelli, Delia Kesner:
Foundations of strong call by need. Proc. ACM Program. Lang. 1(ICFP): 20:1-20:29 (2017) - [j20]Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos:
On abstract normalisation beyond neededness. Theor. Comput. Sci. 672: 36-63 (2017) - [c37]Delia Kesner, Pierre Vial:
Types as Resources for Classical Natural Deduction. FSCD 2017: 24:1-24:17 - [i2]Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca:
Inhabitation for Non-idempotent Intersection Types. CoRR abs/1712.03829 (2017) - 2016
- [c36]Delia Kesner:
Reasoning About Call-by-need by Means of Types. FoSSaCS 2016: 424-441 - [e2]Delia Kesner, Brigitte Pientka:
1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016, June 22-26, 2016, Porto, Portugal. LIPIcs 52, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-010-1 [contents] - 2015
- [j19]Marcelo Finger, Delia Kesner:
Special Issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). Theor. Comput. Sci. 606: 1 (2015) - [c35]Delia Kesner, Daniel Ventura
A Resource Aware Computational Interpretation for Herbelin's Syntax. ICTAC 2015: 388-403 - [c34]Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca:
Observability for Pair Pattern Calculi. TLCA 2015: 123-137 - [c33]Antonio Bucciarelli, Delia Kesner, Daniel Ventura
Strong Normalization through Intersection Types and Memory. LSFA 2015: 75-91 - 2014
- [c32]Flávio L. C. de Moura
Metaconfluence of Calculi with Explicit Substitutions at a Distance. FSTTCS 2014: 391-402 - [c31]Delia Kesner, Daniel Ventura
Quantitative Types for the Linear Substitution Calculus. IFIP TCS 2014: 296-310 - [c30]Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca:
The Inhabitation Problem for Non-idempotent Intersection Types. IFIP TCS 2014: 341-354 - [c29]Beniamino Accattoli, Eduardo Bonelli, Delia Kesner, Carlos Lombardi:
A nonstandard standardization theorem. POPL 2014: 659-670 - [i1]Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos:
An abstract normalisation result with applications to non-sequential calculi. CoRR abs/1412.2118 (2014) - 2012
- [j18]Beniamino Accattoli, Delia Kesner:
Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus. Log. Methods Comput. Sci. 8(1) (2012) - [c28]Beniamino Accattoli, Delia Kesner:
The Permutative λ-Calculus. LPAR 2012: 23-36 - [c27]Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos:
Normalisation for Dynamic Pattern Calculi. RTA 2012: 117-132 - [e1]Delia Kesner, Petrucio Viana:
Proceedings Seventh Workshop on Logical and Semantic Frameworks, with Applications, LSFA 2012, Rio de Janeiro, Brazil, September 29-30, 2012. EPTCS 113, 2012 [contents] - 2011
- [j17]Delia Kesner, Fabien Renaud:
A prismoid framework for languages with resources. Theor. Comput. Sci. 412(37): 4867-4892 (2011) - 2010
- [c26]Beniamino Accattoli, Delia Kesner:
The Structural lambda-Calculus. CSL 2010: 381-395 - [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. Log. Methods Comput. Sci. 5(3) (2009) - [j15]C. Barry Jay, Delia Kesner:
First-class patterns. J. Funct. Program. 19(2): 191-225 (2009) - [c24]Delia Kesner, Fabien Renaud:
The Prismoid of Resources. MFCS 2009: 464-476 - 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. Reason. 39(4): 513-541 (2007) - [c22]Delia Kesner:
The Theory of Calculi with Explicit Substitutions Revisited. CSL 2007: 238-252 - 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]C. Barry Jay, Delia Kesner:
Pure Pattern Calculus. ESOP 2006: 100-114 - 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]Delia Kesner, Stéphane Lengrand:
Extending the Explicit Substitution Paradigm. RTA 2005: 407-422 - 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. Math. Struct. Comput. Sci. 13(3): 409-450 (2003) - [c17]Julien Forest, Delia Kesner:
Expression Reduction Systems with Patterns. RTA 2003: 107-122 - 2001
- [j8]Delia Kesner:
Theory and applications of explicit substitutions: Introduction. Math. Struct. Comput. Sci. 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. J. Funct. Log. Program. 1999(Special Issue 2) (1999) - [c13]Serenella Cerrito, Delia Kesner:
Pattern Matching as Cut Elimination. LICS 1999: 98-108 - 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. J. Funct. Log. Program. 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. Math. Struct. Comput. Sci. 4(3): 315-362 (1994) - [c6]Delia Kesner:
Reasoning about Layered, Wildcard and Product Patterns. ALP 1994: 253-268 - [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]Val Tannen, Delia Kesner, Laurence Puel:
A Typed Pattern Calculus. LICS 1993: 262-274 - 1992
- [c2]Delia Kesner:
Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors. CADE 1992: 603-617 - 1991
- [c1]Delia Kesner:
Pattern Matching in Order-Sorted Languages. MFCS 1991: 267-276
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: