Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Light Logics and Optimal Reduction: Completeness and Complexity   Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.)
has been studied for two different reasons: on the one hand the evaluation of
typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial
(elementary, resp.) bound; on the other hand these terms can also be evaluated
by optimal reduction using the abstract version of Lamping's algorithm. The
first reduction is global while the second one is local and asynchronous. We
prove that for LAL (EAL, resp.) typed terms, Lamping's abstract algorithm also
admits a polynomial (elementary, resp.) bound. We also show its soundness and
completeness (for EAL and LAL with type fixpoints), by using a simple geometry
of interaction model (context semantics).

4
The categories of this paper are: cond-mat
12
The categories of this paper are: nucl-th
34
The categories of this paper are: chem-ph
6
The categories of this paper are: astro-ph
30
The categories of this paper are: q-alg
10
The categories of this paper are: q-bio
18
The categories of this paper are: econ
24
The categories of this paper are: dg-ga
23
The categories of this paper are: solv-int
27
The categories of this paper are: comp-gas
19
The categories of this paper are: eess
22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
16
The categories of this paper are: stat
35
The categories of this paper are: mtrl-th
7
The categories of this paper are: hep-th