research
∙
03/15/2023
Quantitative Global Memory
We show that recent approaches of static analysis based on quantitative ...
share
research
∙
07/14/2022
Node Replication: Theory And Practice
We define and study a term calculus implementing higher-order node repli...
research
∙
01/11/2022
A Faithful and Quantitative Notion of Distant Reduction for Generalized Applications (Long Version)
We introduce a call-by-name lambda-calculus λ J with generalized applica...
research
∙
05/02/2021
The Power of Tightness for Call-By-Push-Value
We propose tight type systems for Call-by-Name (CBN) and Call-by-Value (...
research
∙
01/14/2021
A Strong Bisimulation for Control Operators by Means of Multiplicative and Exponential Reduction
The purpose of this paper is to identify programs with control operators...
research
∙
02/10/2020
The Bang Calculus Revisited
Call-by-Push-Value (CBPV) is a programming paradigm subsuming both Call-...
research
∙
12/04/2019
A Quantitative Understanding of Pattern Matching
This paper shows that the recent approach to quantitative typing systems...
research
∙
06/22/2019
Strong Bisimulation for Control Operators
The purpose of this paper is to identify programs with control operators...
research
∙
12/14/2018
Observability = Typability + Inhabitation
We define an observability property for a calculus with pattern matching...
research
∙
07/06/2018
Tight Typings and Split Bounds
Multi types---aka non-idempotent intersection types---have been used to ...
research
∙
02/15/2018
Non-idempotent types for classical calculi in natural deduction style
In the first part of this paper, we define two resource aware typing sys...
research
∙
01/31/2018
Call-by-need, neededness and all that
We show that call-by-need is observationally equivalent to weak-head nee...
research
∙
12/11/2017
