21 citations · 27 across the 6 of their papers we have counts for
1 paper · 1 filter
Klaus Aehlig, Helmut Schwichtenberg
A syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof pro…