Skip to Main content Skip to Navigation
Other publications

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

Abstract : 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.
Document type :
Other publications
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-00021834
Contributor : Patrick Baillot <>
Submitted on : Monday, March 27, 2006 - 11:12:36 AM
Last modification on : Tuesday, December 1, 2020 - 11:00:03 PM
Long-term archiving on: : Saturday, April 3, 2010 - 11:02:59 PM

Identifiers

Citation

Vincent Atassi, Patrick Baillot, Kazushige Terui. Verification of Ptime reducibility for system F terms via Dual Light Affine Logic.. 2006. ⟨hal-00021834⟩

Share

Metrics

Record views

239

Files downloads

599