1 citations · 1 across the 3 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
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.LO2004
A feasible algorithm for typing in Elementary Affine Logic
Patrick Baillot, Kazushige Terui
We give a new type inference algorithm for typing lambda-terms in Elementary Affine Logic (EAL), which is motivated by applications to complexity and optimal reduction. Following p…
cs.LO2003★ 1 cited
Soft lambda-calculus: a language for polynomial time computation
Patrick Baillot, Virgile Mogbil
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi…