Bounded Linear Logic, Revisited

DOI10.1007/978-3-642-02273-9_8zbMath1211.03089OpenAlexW1876875653MaRDI QIDQ5902142

Ugo Dal Lago, Martin Hofmann

Publication date: 7 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02273-9_8

zbMATH Keywords

extension of bounded linear logic

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (3)

Bounded Linear Logic, Revisited ⋮ Quantitative classical realizability ⋮ Realizability models for a linear dependent PCF

Cites Work

• Unnamed Item
• Unnamed Item
• Linear logic
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Bounded linear logic: A modular approach to polynomial-time computability
• A new recursion-theoretic characterization of the polytime functions
• Light linear logic
• Linear types and non-size-increasing polynomial time computation.
• Linear logic and elementary time
• Realizability models for BLL-like languages
• Soft linear logic and polynomial time
• On an interpretation of safe recursion in light affine logic
• Intuitionistic Light Affine Logic
• Bounded Linear Logic, Revisited

This page was built for publication: Bounded Linear Logic, Revisited