2 citations · 2 across the 4 of their papers we have counts for
4 papers
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…
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…
On the Rationality of Escalation
Pierre Lescanne, Perrinel Matthieu
Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. He…
On the Rationality of Escalation
Pierre Lescanne, Perrinel Matthieu
Escalation is a typical feature of infinite games. Therefore tools conceived for studying infinite mathematical structures, namely those deriving from coinduction are essential. He…