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.

https://doi.org/10.2168/LMCS-6(4:7)2010
Source: arXiv.org:0904.2675
Volume: Volume 6, Issue 4
Secondary volumes: Selected Papers of the 9th Conference on Typed Lambda Calculi and Applications (TLCA 2009)
Published on: December 18, 2010
Imported on: November 16, 2009
Keywords: Computer Science - Logic in Computer Science, F.4.1
Licence: arXiv.org - Non-exclusive license to distribute

Classifications

Mathematics Subject Classification 20201
Sources:
  • [1] zbMATH Open.

9 Documents citing this article

Share and export

Consultation statistics

This page has been seen 3257 times.
This article's PDF has been downloaded 567 times.