Delia Kesner - RankMe

116 papers A* 8A 4B 23C 2Misc 1Journal 56Unranked 19

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Useful Call-by-Value: A Semantic Interpretation via Quantitative Types. CSL Pablo Barenbaum, Delia Kesner, Mariana Milicich
2025	A	`conf`	A Fresh Inductive Approach to Useful Call-by-Value. CADE Pablo Barenbaum, Delia Kesner, Mariana Milicich
2025	J	`jnl`	A quantitative approach to global state composition. Math. Struct. Comput. Sci. Sandra Alves, Delia Kesner, Miguel Ramos
2025	B	`ed.`	Foundations of Software Science and Computation Structures - 28th International Conference, FoSSaCS 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Hamilton, ON, Canada, May 3-8, 2025, Proceedings FoSSaCS Parosh Aziz Abdulla, Delia Kesner
2024	—	`ed.`	29th International Conference on Types for Proofs and Programs, TYPES 2023, ETSInf, Universitat Politècnica de València, Spain, June 12-16, 2023 TYPES Delia Kesner, Eduardo Hermo Reyes, Benno van den Berg
2024	J	`jnl`	A Faithful and Quantitative Notion of Distant Reduction for the Lambda-Calculus with Generalized Applications. Log. Methods Comput. Sci. José Espírito Santo, Delia Kesner, Loïc Peyrot
2024	J	`jnl`	A Strong Bisimulation for a Classical Term Calculus. Log. Methods Comput. Sci. Eduardo Bonelli, Delia Kesner, Andrés Viso
2024	B	`conf`	Extending the Quantitative Pattern-Matching Paradigm. APLAS Sandra Alves, Delia Kesner, Miguel Ramos
2024	J	`jnl`	Extending the Quantitative Pattern-Matching Paradigm. CoRR Sandra Alves, Delia Kesner, Miguel Ramos
2024	A*	`conf`	Genericity Through Stratification. LICS Victor Arrial, Giulio Guerrieri, Delia Kesner
2024	J	`jnl`	Genericity Through Stratification. CoRR Victor Arrial, Giulio Guerrieri, Delia Kesner
2024	J	`jnl`	Hybrid Intersection Types for PCF (Extended Version). CoRR Pablo Barenbaum, Delia Kesner, Mariana Milicich
2024	B	`conf`	Hybrid Intersection Types for PCF. LPAR Pablo Barenbaum, Delia Kesner, Mariana Milicich
2024	B	`conf`	Meaningfulness and Genericity in a Subsuming Framework (Invited Talk). FSCD Delia Kesner, Victor Arrial, Giulio Guerrieri
2024	J	`jnl`	Meaningfulness and Genericity in a Subsuming Framework. CoRR Delia Kesner, Victor Arrial, Giulio Guerrieri
2024	J	`jnl`	Node Replication: Theory And Practice. Log. Methods Comput. Sci. Delia Kesner, Loïc Peyrot, Daniel Ventura
2024	B	`conf`	The Ackermann Award 2023. CSL Maribel Fernández, Jean Goubault-Larrecq, Delia Kesner
2024	—	`conf`	The Benefits of Diligence. IJCAR (2) Victor Arrial, Giulio Guerrieri, Delia Kesner
2024	J	`jnl`	The Benefits of Diligence. CoRR Victor Arrial, Giulio Guerrieri, Delia Kesner
2024	J	`jnl`	The Essense of Useful Evaluation Through Quantitative Types (Extended Version). CoRR Pablo Barenbaum, Delia Kesner, Mariana Milicich
2023	—	`ed.`	28th International Conference on Types for Proofs and Programs, TYPES 2022, LS2N, University of Nantes, France, June 20-25, 2022 TYPES Delia Kesner, Pierre-Marie Pédrot
2023	J	`jnl`	Milner's Lambda-Calculus with Partial Substitutions. CoRR Delia Kesner, Shane Ó Conchúir
2023	C	`conf`	Quantitative Global Memory. WoLLIC Sandra Alves, Delia Kesner, Miguel Ramos
2023	J	`jnl`	Quantitative Global Memory. CoRR Sandra Alves, Delia Kesner, Miguel Ramos
2023	J	`jnl`	Quantitative Inhabitation for Different Lambda Calculi in a Unifying Framework. Proc. ACM Program. Lang. Victor Arrial, Giulio Guerrieri, Delia Kesner
2023	J	`jnl`	The bang calculus revisited. Inf. Comput. Antonio Bucciarelli, Delia Kesner, Alejandro Ríos, Andrés Viso
2022	J	`jnl`	A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications (Long Version). CoRR José Espírito Santo, Delia Kesner, Loïc Peyrot
2022	B	`conf`	A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications. FoSSaCS José Espírito Santo, Delia Kesner, Loïc Peyrot
2022	J	`jnl`	A fine-grained computational interpretation of Girard's intuitionistic proof-nets. Proc. ACM Program. Lang. Delia Kesner
2022	B	`conf`	Encoding Tight Typing in a Unified Framework. CSL Delia Kesner, Andrés Viso
2022	J	`jnl`	Node Replication: Theory And Practice. CoRR Delia Kesner, Loïc Peyrot, Daniel Ventura
2022	B	`conf`	Solvability for Generalized Applications. FSCD Delia Kesner, Loïc Peyrot
2021	J	`jnl`	A Strong Bisimulation for Control Operators by Means of Multiplicative and Exponential Reduction. CoRR Eduardo Bonelli, Delia Kesner, Andrés Viso
2021	J	`jnl`	Solvability = Typability + Inhabitation. Log. Methods Comput. Sci. Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca
2021	J	`jnl`	The Power of Tightness for Call-By-Push-Value. CoRR Delia Kesner, Andrés Viso
2021	B	`conf`	The Spirit of Node Replication. FoSSaCS Delia Kesner, Loïc Peyrot, Daniel Ventura
2020	A*	`conf`	Consuming and Persistent Types for Classical Logic. LICS Delia Kesner, Pierre Vial
2020	J	`jnl`	Non-idempotent types for classical calculi in natural deduction style. Log. Methods Comput. Sci. Delia Kesner, Pierre Vial
2020	B	`conf`	Strong Bisimulation for Control Operators (Invited Talk). CSL Delia Kesner, Eduardo Bonelli, Andrés Viso
2020	Misc	`conf`	The Bang Calculus Revisited. FLOPS Antonio Bucciarelli, Delia Kesner, Alejandro Ríos, Andrés Viso
2020	J	`jnl`	The Bang Calculus Revisited. CoRR Antonio Bucciarelli, Delia Kesner, Alejandro Ríos, Andrés Viso
2020	J	`jnl`	Tight typings and split bounds, fully developed. J. Funct. Program. Beniamino Accattoli, Stéphane Graham-Lengrand, Delia Kesner
2019	—	`conf`	A Quantitative Understanding of Pattern Matching. TYPES Sandra Alves, Delia Kesner, Daniel Ventura
2019	J	`jnl`	A Quantitative Understanding of Pattern Matching. CoRR Sandra Alves, Delia Kesner, Daniel Ventura
2019	J	`jnl`	A resource aware semantics for a focused intuitionistic calculus. Math. Struct. Comput. Sci. Delia Kesner, Daniel Ventura
2019	J	`jnl`	Strong Bisimulation for Control Operators. CoRR Eduardo Bonelli, Delia Kesner, Andrés Viso
2018	B	`conf`	Call-by-Need, Neededness and All That. FoSSaCS Delia Kesner, Alejandro Ríos, Andrés Viso
2018	J	`jnl`	Call-by-need, neededness and all that. CoRR Delia Kesner, Alejandro Ríos, Andrés Viso
2018	J	`jnl`	Inhabitation for Non-idempotent Intersection Types. Log. Methods Comput. Sci. Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca
2018	J	`jnl`	Non-idempotent types for classical calculi in natural deduction style. CoRR Delia Kesner, Pierre Vial
2018	J	`jnl`	Observability = Typability + Inhabitation. CoRR Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca
2018	J	`jnl`	Tight Typings and Split Bounds. CoRR Beniamino Accattoli, Stéphane Graham-Lengrand, Delia Kesner
2018	J	`jnl`	Tight typings and split bounds. Proc. ACM Program. Lang. Beniamino Accattoli, Stéphane Graham-Lengrand, Delia Kesner
2017	J	`jnl`	Foundations of strong call by need. Proc. ACM Program. Lang. Thibaut Balabonski, Pablo Barenbaum, Eduardo Bonelli, Delia Kesner
2017	J	`jnl`	Inhabitation for Non-idempotent Intersection Types. CoRR Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca
2017	J	`jnl`	Non-idempotent intersection types for the Lambda-Calculus. Log. J. IGPL Antonio Bucciarelli, Delia Kesner, Daniel Ventura
2017	J	`jnl`	On abstract normalisation beyond neededness. Theor. Comput. Sci. Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos
2017	B	`conf`	Types as Resources for Classical Natural Deduction. FSCD Delia Kesner, Pierre Vial
2016	B	`ed.`	1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016, Porto, Portugal, June 22-26, 2016 FSCD Delia Kesner, Brigitte Pientka
2016	B	`conf`	Reasoning About Call-by-need by Means of Types. FoSSaCS Delia Kesner
2015	C	`conf`	A Resource Aware Computational Interpretation for Herbelin's Syntax. ICTAC Delia Kesner, Daniel Ventura
2015	—	`conf`	Observability for Pair Pattern Calculi. TLCA Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca
2015	J	`jnl`	Special Issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA). Theor. Comput. Sci. Marcelo Finger, Delia Kesner
2015	—	`conf`	Strong Normalization through Intersection Types and Memory. LSFA Antonio Bucciarelli, Delia Kesner, Daniel Ventura
2014	A*	`conf`	A nonstandard standardization theorem. POPL Beniamino Accattoli, Eduardo Bonelli, Delia Kesner, Carlos Lombardi
2014	J	`jnl`	An abstract normalisation result with applications to non-sequential calculi. CoRR Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos
2014	—	`conf`	Metaconfluence of Calculi with Explicit Substitutions at a Distance. FSTTCS Flávio L. C. de Moura, Delia Kesner, Mauricio Ayala-Rincón
2014	—	`conf`	Quantitative Types for the Linear Substitution Calculus. IFIP TCS Delia Kesner, Daniel Ventura
2014	—	`conf`	The Inhabitation Problem for Non-idempotent Intersection Types. IFIP TCS Antonio Bucciarelli, Delia Kesner, Simona Ronchi Della Rocca
2012	—	`conf`	Normalisation for Dynamic Pattern Calculi. RTA Eduardo Bonelli, Delia Kesner, Carlos Lombardi, Alejandro Ríos
2012	J	`jnl`	Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus Log. Methods Comput. Sci. Beniamino Accattoli, Delia Kesner
2012	—	`ed.`	Proceedings Seventh Workshop on Logical and Semantic Frameworks, with Applications, LSFA 2012, Rio de Janeiro, Brazil, September 29-30, 2012. LSFA Delia Kesner, Petrucio Viana
2012	B	`conf`	The Permutative λ-Calculus. LPAR Beniamino Accattoli, Delia Kesner
2011	J	`jnl`	A prismoid framework for languages with resources. Theor. Comput. Sci. Delia Kesner, Fabien Renaud
2010	—	`conf`	A standardisation proof for algebraic pattern calculi HOR Delia Kesner, Carlos Lombardi, Alejandro Ríos
2010	B	`conf`	The Structural CSL Beniamino Accattoli, Delia Kesner
2009	J	`jnl`	A Theory of Explicit Substitutions with Safe and Full Composition Log. Methods Comput. Sci. Delia Kesner
2009	J	`jnl`	First-class patterns. J. Funct. Program. C. Barry Jay, Delia Kesner
2009	B	`conf`	The Prismoid of Resources. MFCS Delia Kesner, Fabien Renaud
2008	—	`conf`	Perpetuality for Full and Safe Composition (in a Constructive Setting). ICALP (2) Delia Kesner
2007	J	`jnl`	Expression Reduction Systems with Patterns. J. Autom. Reason. Julien Forest, Delia Kesner
2007	J	`jnl`	Resource operators for lambda-calculus. Inf. Comput. Delia Kesner, Stéphane Lengrand
2007	B	`conf`	The Theory of Calculi with Explicit Substitutions Revisited. CSL Delia Kesner
2006	A	`conf`	Pure Pattern Calculus. ESOP C. Barry Jay, Delia Kesner
2006	A	`conf`	Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic. IJCAR Roy Dyckhoff, Delia Kesner, Stéphane Lengrand
2005	—	`conf`	Expression Reduction Systems and Extensions: An Overview. Processes, Terms and Cycles John R. W. Glauert, Delia Kesner, Zurab Khasidashvili
2005	—	`conf`	Extending the Explicit Substitution Paradigm. RTA Delia Kesner, Stéphane Lengrand
2005	J	`jnl`	Relating Higher-order and First-order Rewriting. J. Log. Comput. Eduardo Bonelli, Delia Kesner, Alejandro Ríos
2005	J	`jnl`	de Bruijn Indices for Metaterms. J. Log. Comput. Eduardo Bonelli, Delia Kesner, Alejandro Ríos
2004	J	`jnl`	Pattern matching as cut elimination. Theor. Comput. Sci. Serenella Cerrito, Delia Kesner
2003	—	`conf`	Expression Reduction Systems with Patterns. RTA Julien Forest, Delia Kesner
2003	J	`jnl`	Proof Nets And Explicit Substitutions. Math. Struct. Comput. Sci. Roberto Di Cosmo, Delia Kesner, Emmanuel Polonowski
2001	—	`conf`	From Higher-Order to First-Order Rewriting. RTA Eduardo Bonelli, Delia Kesner, Alejandro Ríos
2001	J	`jnl`	Theory and applications of explicit substitutions: Introduction. Math. Struct. Comput. Sci. Delia Kesner
2000	—	`conf`	A de Bruijn Notation for Higher-Order Rewriting. RTA Eduardo Bonelli, Delia Kesner, Alejandro Ríos
2000	J	`jnl`	Confluence of extensional and non-extensional lambda-calculi with explicit substitutions. Theor. Comput. Sci. Delia Kesner
2000	B	`conf`	Proof Nets and Explicit Substitutions. FoSSaCS Roberto Di Cosmo, Delia Kesner, Emmanuel Polonowski
1999	J	`jnl`	Explicit Substitutions for Objects and Functions J. Funct. Log. Program. Delia Kesner, Pablo E. Martínez López
1999	A*	`conf`	Pattern Matching as Cut Elimination. LICS Serenella Cerrito, Delia Kesner
1999	J	`jnl`	lambda-Calculi with Explicit Substitutions Preserving Strong Normalization. Appl. Algebra Eng. Commun. Comput. Maria C. F. Ferreira, Delia Kesner, Laurence Puel
1998	—	`conf`	Explicit Substitutions for Objects and Functions. PLILP/ALP Delia Kesner, Pablo E. Martínez López
1998	B	`conf`	Reducing AC-Termination to Termination. MFCS Maria C. F. Ferreira, Delia Kesner, Laurence Puel
1997	J	`jnl`	Reasoning about Redundant Patterns. J. Funct. Log. Program. Delia Kesner
1997	A*	`conf`	Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract). LICS Roberto Di Cosmo, Delia Kesner
1996	J	`jnl`	A Typed Pattern Calculus. Inf. Comput. Delia Kesner, Laurence Puel, Val Tannen
1996	J	`jnl`	Combining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints. Theor. Comput. Sci. Roberto Di Cosmo, Delia Kesner
1996	—	`conf`	Confluence Properties of Extensional and Non-Extensional RTA Delia Kesner
1996	—	`conf`	Lambda-Calculi with Explicit Substitutions and Composition Which Preserve Beta-Strong Normalization. ALP Maria C. F. Ferreira, Delia Kesner, Laurence Puel
1995	B	`conf`	Rewriting with Extensional Polymorphic Lambda-Calculus. CSL Roberto Di Cosmo, Delia Kesner
1994	A*	`conf`	Combining First Order Algebraic Rewriting Systems, Recursion and Extensional Lambda Calculi. ICALP Roberto Di Cosmo, Delia Kesner
1994	—	`conf`	Reasoning about Layered, Wildcard and Product Patterns. ALP Delia Kesner
1994	J	`jnl`	Simulating Expansions without Expansions. Math. Struct. Comput. Sci. Roberto Di Cosmo, Delia Kesner
1993	A*	`conf`	A Confluent Reduction for the Extensional Typed lambda-Calculus with Pairs, Sums, Recursion and terminal Object. ICALP Roberto Di Cosmo, Delia Kesner
1993	A*	`conf`	A Typed Pattern Calculus LICS Val Tannen, Delia Kesner, Laurence Puel
1992	A	`conf`	Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors. CADE Delia Kesner
1991	B	`conf`	Pattern Matching in Order-Sorted Languages. MFCS Delia Kesner