CSL 2006: Computer Science Logic pp 150-166

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

  • Vincent Atassi
  • Patrick Baillot
  • Kazushige Terui
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4207)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Vincent Atassi
    • 1
  • Patrick Baillot
    • 1
  • Kazushige Terui
    • 2
  1. 1.LIPN, Univ. Paris 13 / CNRSFrance
  2. 2.National Institute of InformaticsJapan

Personalised recommendations