1 citations · 2 across the 3 of their papers we have counts for
Showing cs.LOShow all
3 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★ 1 cited
Weak Affine Light Typing is complete with respect to Safe Recursion on Notation
Luca Roversi
Weak affine light typing (WALT) assigns light affine linear formulae as types to a subset of lambda-terms of System F. WALT is poly-time sound: if a lambda-term M has type in WALT,…
cs.LO2007★ 1 cited
Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness
Luca Roversi
Weak affine light typing (WALT) assigns light affine linear formulae as types to a subset of lambda-terms in System F. WALT is poly-time sound: if a lambda-term M has type in WALT,…