2 citations · 2 across the 4 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2017
Paths-based criteria and application to linear logic subsystems characterizing polynomial time
Matthieu Perrinel
Several variants of linear logic have been proposed to characterize complexity classes in the proofs-as-programs correspondence. Light linear logic (LLL) ensures a polynomial bound…
cs.LO2012
On paths-based criteria for polynomial time complexity in proof-nets
Matthieu Perrinel
Girard's Light linear logic (LLL) characterized polynomial time in the proof-as-program paradigm with a bound on cut elimination. This logic relied on a stratification principle an…