Theoretical Computer Science
Bounded linear logic: a modular approach to polynomial-time computability
Theoretical Computer Science
Stratified functional programs and computational complexity
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Basic proof theory
Information and Computation
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
Linear types and non-size-increasing polynomial time computation
Information and Computation - Special issue: ICC '99
Linear logic and elementary time
Information and Computation - Special issue: ICC '99
Realizability models for BLL-like languages
Theoretical Computer Science - Implicit computational complexity
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
On an interpretation of safe recursion in light affine logic
Theoretical Computer Science - Implicit computational complexity
Stratified Bounded Affine Logic for Logarithmic Space
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Linear dependent types for differential privacy
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
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.