19 citations · 55 across the 22 of their papers we have counts for
3 papers · 1 filter
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
Giulio Guerrieri, Luca Paolini, Simona Ronchi Della Rocca
We study an extension of Plotkin's call-by-value lambda-calculus via two commutation rules (sigma-reductions). These commutation rules are sufficient to remove harmful call-by-valu…
Open Call-by-Value (Extended Version)
Beniamino Accattoli, Giulio Guerrieri
The elegant theory of the call-by-value lambda-calculus relies on weak evaluation and closed terms, that are natural hypotheses in the study of programming languages. To model proo…
Relational type-checking for MELL proof-structures. Part 1: Multiplicatives
Giulio Guerrieri, Luc Pellissier, Lorenzo Tortora de Falco
Relational semantics for linear logic is a form of non-idempotent intersection type system, from which several informations on the execution of a proof-structure can be recovered.…