Verification of Ptime reducibility for system F terms via Dual Light Affine Logic.

Notwithstanding this distinction, their approach to λ-calculus with linear combinations of terms contrasts with ours: consider terms up to ≡ rather than some variant of =, and

The criterion for recognizing proof-nets among proof-structures is that every circuit using alternatively B and R edges should contain a chord, where a chord is an edge (directed

Interestingly, this approach allows us to handle the problem of default theories containing inconsistent standard-logic knowledge, using the default logic framework itself..

Given that the structures dual to finite lattices can be naturally associated with monotone neighbourhood frames, and given that monotone neighbourhood frames are standard models

DLAL keeps the same properties as LAL (P- completeness and polynomial bound on execution) but ensures the complexity bound on the lambda-term it- self: if a term is typable one

Given a fixed ring structure K we define an extension of Terui’s light affine lambda-calculus typed in LAL (Light Affine Logic) with a basic type for K.. We show that this

We relate these two different views by giving a categorical version of the topological construction, yielding two benefits: on the one hand, we obtain canonical models of the

So, by using the bound on a standard reduction step and by the fact that the number of standard reduction steps depends on the shape of the program, we adapt fact 2 above by