A syntactical analysis of non-size-increasing polynomial time computation
Aehlig, Klaus · Schwichtenberg, Helmut
Original · EN
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 provides explicit polynomial bounds that can easily be calculated.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.