Bounded Linear Logic, Revisited
Logic in Computer Science
2015-07-01 v5
Abstract
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.
Keywords
Cite
@article{arxiv.0904.2675,
title = {Bounded Linear Logic, Revisited},
author = {Ugo Dal Lago and Martin Hofmann},
journal= {arXiv preprint arXiv:0904.2675},
year = {2015}
}