
Semantic Bounds and Strong CallbyValue Normalization
This paper explores two topics at once: the use of denotational semantic...
read it

On reduction and normalization in the computational core
We study the reduction in a lambdacalculus derived from Moggi's computa...
read it

Factorization in CallbyName and CallbyValue Calculi via Linear Logic (long version)
In each variant of the lambdacalculus, factorization and normalization ...
read it

Gluing resource proofstructures: inhabitation and inverting the Taylor expansion
A MultiplicativeExponential Linear Logic (MELL) proofstructure can be ...
read it

Factorize Factorization
We present a new technique for proving factorization theorems for compou...
read it

Decomposing Probabilistic Lambdacalculi
A notion of probabilistic lambdacalculus usually comes with a prescribe...
read it

Glueability of resource proofstructures: inverting the Taylor expansion (long version)
A MultiplicativeExponential Linear Logic (MELL) proofstructure can be ...
read it

Factorization and Normalization, Essentially
Lambdacalculi come with no fixed evaluation strategy. Different strateg...
read it

Crumbling Abstract Machines
Extending the lambdacalculus with a construct for sharing, such as let ...
read it

Towards a Semantic Measure of the Execution Time in CallbyValue lambdaCalculus
We investigate the possibility of a semantic account of the execution ti...
read it

The Bang Calculus and the Two Girard's Translations
We study the two Girard's translations of intuitionistic implication int...
read it

Types by Need (Extended Version)
A cornerstone of the theory of lambdacalculus is that intersection type...
read it

Towards a Semantic Measure of the Execution Time in CallbyValue lambdaCalculus (Long Version)
We investigate the possibility of a semantic account of the execution ti...
read it

Types of Fireballs (Extended Version)
The good properties of Plotkin's callbyvalue lambdacalculus crucially...
read it
Giulio Guerrieri
is this you? claim profile