Bounded Linear Logic, Revisited

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...

Full description

Bibliographic Details
Published in:Logical Methods in Computer Science
Main Authors: Ugo Dal Lago, Martin Hofmann
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2010-12-01
Subjects:
computer science - logic in computer science
f.4.1
Online Access:https://lmcs.episciences.org/1064/pdf
Description
Summary: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.
ISSN:1860-5974

Similar Items