48 citations · 118 across the 8 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.CC2012
Computational Complexity of Interactive Behaviors
Ugo Dal Lago, Tobias Heindel, Damiano Mazza +1
The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a bro…
cs.LO2012★ 4 cited
An Abstract Approach to Stratification in Linear Logic
Pierre Boudes, Damiano Mazza, Lorenzo Tortora de Falco
We study the notion of stratification, as used in subsystems of linear logic with low complexity bounds on the cut-elimination procedure (the so-called light logics), from an abstr…