activity
20092024
most citedA Theory of Explicit Substitutions with Safe and Full Composition

37 citations · 96 across the 19 of their papers we have counts for

collaborators

24 papers

cs.PL2024

Extending the Quantitative Pattern-Matching Paradigm

Sandra Alves, Delia Kesner, Miguel Ramos

We show how (well-established) type systems based on non-idempotent intersection types can be extended to characterize termination properties of functional programming languages wi…

cs.LO2024★ 1 cited

Hybrid Intersection Types for PCF (Extended Version)

Pablo Barenbaum, Delia Kesner, Mariana Milicich

Intersection type systems have been independently applied to different evaluation strategies, such as call-by-name (CBN) and call-by-value (CBV). These type systems have been then…

cs.LO2024

The Benefits of Diligence

Victor Arrial, Giulio Guerrieri, Delia Kesner

This paper studies the strength of embedding Call-by-Name ({\tt dCBN}) and Call-by-Value ({\tt dCBV}) into a unifying framework called the Bang Calculus ({\tt dBANG}). These embedd…

cs.LO2024

Meaningfulness and Genericity in a Subsuming Framework

Delia Kesner, Victor Arrial, Giulio Guerrieri

This paper studies the notion of meaningfulness for a unifying framework called dBang-calculus, which subsumes both call-by-name (dCbN) and call-by-value (dCbV). We first character…

cs.LO2024

Useful Evaluation: Syntax and Semantics (Technical Report)

Pablo Barenbaum, Delia Kesner, Mariana Milicich

This work provides the first inductive definition of useful CBV evaluation. For that, we first restrict the substitution operation in the Value Substitution Calculus to be linear,…

cs.LO2024★ 1 cited

Genericity Through Stratification

Victor Arrial, Giulio Guerrieri, Delia Kesner

A fundamental issue in the -calculus is to find appropriate notions for meaningfulness. It is well-known that in the call-by-name -calculus (CbN) the meaningful terms can be…