Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Verification of Ptime Reducibility for system F Terms: Type Inference
  in<br> Dual Light Affine Logic   In a previous work Baillot and Terui introduced Dual light affine logic
(DLAL) as a variant of Light linear logic suitable for guaranteeing complexity
properties on lambda calculus terms: all typable terms can be evaluated in
polynomial time by beta reduction and all Ptime functions can be represented.
In the present work we address the problem of typing lambda-terms in
second-order DLAL. For that we give a procedure which, starting with a term
typed in system F, determines whether it is typable in DLAL and outputs a
concrete typing if there exists any. We show that our procedure can be run in
time polynomial in the size of the original Church typed system F term.

33
The categories of this paper are: plasm-ph
14
The categories of this paper are: math-ph
13
The categories of this paper are: quant-ph
30
The categories of this paper are: q-alg
32
The categories of this paper are: atom-ph
21
The categories of this paper are: adap-org
25
The categories of this paper are: patt-sol
31
The categories of this paper are: ao-sci
0
The categories of this paper are: hep-ph
37
The categories of this paper are: supr-con
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin
18
The categories of this paper are: econ
2
The categories of this paper are: math
12
The categories of this paper are: nucl-th
19
The categories of this paper are: eess