Verification of Ptime reducibility for system F terms via Dual Light Affine Logic
<|reference_start|>Verification of Ptime reducibility for system F terms via Dual Light Affine Logic: In a previous work we introduced Dual Light Affine Logic (DLAL) ([BaillotTerui04]) 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.<|reference_end|>
@article{atassi2006verification,
    title={Verification of Ptime reducibility for system F terms via Dual Light
  Affine Logic},
    author={Vincent Atassi (LIPN), Patrick Baillot (LIPN), Kazushige Terui (NII)},
    journal={A para\^{i}tre dans Proceedings Computer Science Logic 2006
  (CSL'06), LNCS, Springer. (2006)},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0603104},
    primaryClass={cs.LO}
}