activity
20002007
most citedOn the computational complexity of cut-reduction

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing 2000Show all

1 paper · 1 filter

cs.LO2000

A syntactical analysis of non-size-increasing polynomial time computation

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…