Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 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.

33
The categories of this paper are: plasm-ph
34
The categories of this paper are: chem-ph
26
The categories of this paper are: bayes-an
35
The categories of this paper are: mtrl-th
30
The categories of this paper are: q-alg
24
The categories of this paper are: dg-ga
12
The categories of this paper are: nucl-th
23
The categories of this paper are: solv-int
8
The categories of this paper are: hep-ex
19
The categories of this paper are: eess
36
The categories of this paper are: cmp-lg
2
The categories of this paper are: math
18
The categories of this paper are: econ
14
The categories of this paper are: math-ph
9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol