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

K. Aehlig, H. Schwichtenberg
Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332)  
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.1109/lics.2000.855758 dblp:conf/lics/AehligS00 fatcat:3da5ldz6ofaklckxozjcs57pva