24 citations · 24 across the 1 of their papers we have counts for
1 paper
U. Dal Lago, M. Hofmann
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Elementary Affine Logic, LFPL (a language for polytime computatio…