Showing cs.LOShow 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.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…