22 citations · 69 across the 23 of their papers we have counts for
1 paper · 2 filters
Clément Aubert, Thomas Seiller
In a recent work, Girard proposed a new and innovative approach to computational complexity based on the proofs-as-programs correspondence. In a previous paper, the authors showed…