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

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

2006-03-27

arxiv.org/abs/cs/0603104v1

A para\^{i}tre dans Proceedings Computer Science Logic 2006 (CSL'06), LNCS, Springer. (2006)

Computer Science

Logic in Computer Science

21 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Verification of Ptime reducibility for system F terms via Dual Light Affine Logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Verification of Ptime reducibility for system F terms via Dual Light Affine Logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Verification of Ptime reducibility for system F terms via Dual Light Affine Logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-413386