Ugo Dal Lago ; Martin Hofmann - Bounded Linear Logic, Revisited

lmcs:1064 - Logical Methods in Computer Science, December 18, 2010, Volume 6, Issue 4 - https://doi.org/10.2168/LMCS-6(4:7)2010
Bounded Linear Logic, RevisitedArticle

Authors: Ugo Dal Lago ORCID; Martin Hofmann

    We present QBAL, an extension of Girard, Scedrov and Scott's bounded linear logic. The main novelty of the system is the possibility of quantifying over resource variables. This generalization makes bounded linear logic considerably more flexible, while preserving soundness and completeness for polynomial time. In particular, we provide compositional embeddings of Leivant's RRW and Hofmann's LFPL into QBAL.


    Volume: Volume 6, Issue 4
    Published on: December 18, 2010
    Imported on: November 16, 2009
    Keywords: Computer Science - Logic in Computer Science,F.4.1

    6 Documents citing this article

    Consultation statistics

    This page has been seen 1183 times.
    This article's PDF has been downloaded 336 times.