A syntactical analysis of non-size-increasing polynomial time computation
<|reference_start|>A syntactical analysis of non-size-increasing polynomial time computation: 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.<|reference_end|>
@article{aehlig2000a,
    title={A syntactical analysis of non-size-increasing polynomial time
  computation},
    author={Klaus Aehlig, Helmut Schwichtenberg},
    journal={ACM Transactions on Computational Logic 3(3), 383-401 (2002)},
    year={2000},
    archivePrefix={arXiv},
    eprint={cs/0011037},
    primaryClass={cs.LO}
}