Archive for Mathematical Logic

, Volume 46, Issue 3, pp 253–280

Light affine lambda calculus and polynomial time strong normalization

Article

DOI: 10.1007/s00153-007-0042-6

Cite this article as:
Terui, K. Arch. Math. Logic (2007) 46: 253. doi:10.1007/s00153-007-0042-6

Abstract

Light Linear Logic (LLL) and Intuitionistic Light Affine Logic (ILAL) are logics that capture polynomial time computation. It is known that every polynomial time function can be represented by a proof of these logics via the proofs-as-programs correspondence. Furthermore, there is a reduction strategy which normalizes a given proof in polynomial time. Given the latter polynomial time “weak” normalization theorem, it is natural to ask whether a “strong” form of polynomial time normalization theorem holds or not. In this paper, we introduce an untyped term calculus, called Light Affine Lambda Calculus (λLA), which corresponds to ILAL. λLA is a bi-modal λ-calculus with certain constraints, endowed with very simple reduction rules. The main property of LALC is the polynomial time strong normalization: any reduction strategy normalizes a given λLA term in a polynomial number of reduction steps, and indeed in polynomial time. Since proofs of ILAL are structurally representable by terms of λLA, we conclude that the same holds for ILAL.

Keywords

Light logicsLambda calculusPolynomial time

Copyright information

© Springer-Verlag 2007

Authors and Affiliations

  1. 1.National Institute of InformaticsTokyoJapan