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, whilepreserving soundness and completeness for polynomial time. In particular, we providecompositional embeddings of Leivant’s RRW and Hofmann’s LFPL into QBAL.
Ugo Dal Lago, Martin Hofmann (2010). Bounded Linear Logic, Revisited. LOGICAL METHODS IN COMPUTER SCIENCE, 6(4), 1-31 [10.2168/LMCS-6(4:7)2010].
Bounded Linear Logic, Revisited
DAL LAGO, UGO;
2010
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, whilepreserving soundness and completeness for polynomial time. In particular, we providecompositional embeddings of Leivant’s RRW and Hofmann’s LFPL into QBAL.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
