Lics

IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Thirteenth Annual IEEE Symposium on

Logic in Computer Science (LICS 1998)

Paper: Light Affine Logic (at LICS 1998)

Authors: Andrea Asperti

Abstract

Much effort has been recently devoted to the study of polytime formal (and especially logical) systems. The purpose of such systems is manyfold. On the theoretical side, they provide a better understanding of what is the logical essence of polytime reduction (and other complexity classes). On the practical side, via the well known Curry-Howard correspondence, they yield sophisticated typing systems, where types provide (statically) an accurate upper bound on the complexity of the computation. Even more, the type annotations give essential information on the “efficient way” to reduce the term. The most promising of these logical systems is Girard's light linear logic. In this paper, we introduce a slight variation of LLL, by adding full weakening (for this reason, we call it light affine logic). This modification does not alter the good complexity properties of LLL: cut-elimination is still polytime. On the other side, the logical system is much simpler: we reduce it from 21 to just 11 rules, and with simpler, traditional sequents. Rephrasing Girard, we could thus say that the abuse of contraction may have damaging complexity effects, but the abstinence from weakening leads to inessential syntactical complications

BibTeX

  @InProceedings{Asperti-LightAffineLogic,
    author = 	 {Andrea Asperti},
    title = 	 {Light Affine Logic},
    booktitle =  {Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science (LICS 1998)},
    year =	 {1998},
    month =	 {June}, 
    pages =      {300--308},
    location =   {Indianapolis, IN, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2017-04-0512:37
Andrzej Murawski