48 citations · 321 across the 68 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
cs.LO2008
Taming Modal Impredicativity: Superlazy Reduction
Ugo Dal Lago, Luca Roversi, Luca Vercelli
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is considered as computation. We introduce modal impredicativity as a new form of impredicativi…
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…