Computer Science – Logic in Computer Science
Scientific paper
2009-04-17
LMCS 6 (4:7) 2010
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-6(4:7)2010
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.
Hofmann Martin
Lago Ugo Dal
No associations
LandOfFree
Bounded Linear Logic, Revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bounded Linear Logic, Revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounded Linear Logic, Revisited will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-141162