An arithmetic for non-size-increasing polynomial-time computation

Abstract

An arithmetical system is presented with the property that from every proof a realizing term can be extracted that is definable in a certain affine linear typed variant of Gödel's T and therefore defines a non-size-increasing polynomial time computable function.