A purely syntactical proof is given that all functions definable in a certain affine linear typed -calculus with iteration in all types are polynomial time computable. The proof also gives explicit polynomial bounds that can easily be calculated.
E-Mail: | schwicht@rz.mathematik.uni-muenchen.de |
Homepage: | www.mathematik.uni-muenchen.de/~schwicht/ |