A syntactical analysis of non-size-increasing polynomial time computation
Logic in Computer Science
2007-05-23 v2
Abstract
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.
Cite
@article{arxiv.cs/0011037,
title = {A syntactical analysis of non-size-increasing polynomial time computation},
author = {Klaus Aehlig and Helmut Schwichtenberg},
journal= {arXiv preprint arXiv:cs/0011037},
year = {2007}
}
Comments
20 pages (latex), revised submission (expanded proofs, extended references, new section on tree iteration)