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

Klaus Aehlig, Helmut Schwichtenberg
2002 ACM Transactions on Computational Logic  
A 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 provides explicit polynomial bounds that can easily be calculated.
doi:10.1145/507382.507386 fatcat:pcrpkr7mine3lfljuxu7obqnsu