Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logic

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 lambdaterms 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.

• Type: Conference
• Year: 2006
• Where: CSL
• Authors: Vincent Atassi, Patrick Baillot, Kazushige Terui
• Keywords: Automated Reasoning, CSL 2006, DLAL Typed Term, Dual Light Affine, Light Linear Logic