Abstract. Light Linear Logic (LLL) and Intuitionistic Light Affine Logic (ILAL) are logics that capture polynomial time computation.

Feb 21, 2007 · The main property of LALC is the polynomial time strong normalization: any reduction strategy normalizes a given λLA term in a polynomial number ...

In this paper, we introduce an untyped term calculus, called the light affine lambda calculus (/spl lambda//sub LA/), generalizing the essential ideas of light ...

Abstract. Light Linear Logic (LLL) and Intuitionistic Light Affine Logic (ILAL) are logics that capture polynomial time computation.

This paper introduces an untyped term calculus, called the light affine lambda calculus, which is a simple modification of the /spl lambda/-calculus, ...

This paper introduces an untyped term calculus, called Light Affine Lambda Calculus (λLA), which corresponds to ILAL, and concludes that proofs of ILAL are ...

dence), and conversely that there is a specific re- duction (cut-elimination) strategy which normalizes a given proof in polynomial time (the latter may ...

Later on, I also proved a polystep strong normalization result for this system, as originally shown by Kazushige Terui for his light-affine λ-calculus [Ter01] : ...

We present a polymorphic type system for lambda calculus ensuring that well-typed programs can be executed in polynomial time: dual light affine logic ...

Light affine lambda calculus and polynomial time strong normalization. Overview of attention for article published in Archive for Mathematical Logic ...