Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic
- Cite this paper as:
- Atassi V., Baillot P., Terui K. (2006) Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic. In: Ésik Z. (eds) Computer Science Logic. CSL 2006. Lecture Notes in Computer Science, vol 4207. Springer, Berlin, Heidelberg
In a previous work we introduced Dual Light Affine Logic (DLAL) ([BT04]) 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 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, finds all possible ways to decorate it into a DLAL typed term. We show that our procedure can be run in time polynomial in the size of the original Church typed system F term.
Unable to display preview. Download preview PDF.