15 citations · 16 across the 3 of their papers we have counts for
3 papers
cs.LO2008★ 15 cited
Light Logics and the Call-by-Value Lambda Calculus
Paolo Coppola, Ugo Dal Lago, Simona Ronchi Della Rocca
The so-called light logics have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus f…
cs.LO2007
Light Logics and Optimal Reduction: Completeness and Complexity
Patrick Baillot, Paolo Coppola, Ugo Dal Lago
Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (E…
cs.LO2003★ 1 cited
Optimizing Optimal Reduction: A Type Inference Algorithm for Elementary Affine Logic
Paolo Coppola, Simone Martini
We present a type inference algorithm for lambda-terms in Elementary Affine Logic using linear constraints. We prove that the algorithm is correct and complete.