Bounded Linear Logic, Revisited

DOI10.1007/978-3-642-02273-9_8MaRDI QIDQ5902142zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Bounded linear logic, revisited
• Linear logic for nets with bounded resources
• scientific article; zbMATH DE number 176206
• Bounded linear logic: A modular approach to polynomial-time computability
• Linear logic and polynomial time

Cites work

• A new recursion-theoretic characterization of the polytime functions
• Bounded Linear Logic, Revisited
• Bounded linear logic: A modular approach to polynomial-time computability
• scientific article; zbMATH DE number 1696756 (Why is no real title available?)
• scientific article; zbMATH DE number 949290 (Why is no real title available?)
• Intuitionistic light affine logic
• Light linear logic
• Linear logic
• Linear logic and elementary time
• Linear types and non-size-increasing polynomial time computation.
• On an interpretation of safe recursion in light affine logic
• Realizability models for BLL-like languages
• Soft linear logic and polynomial time
• The lambda calculus. Its syntax and semantics. Rev. ed.

Cited in

(12)

• New Curry-Howard terms for full linear logic
• Quantitative classical realizability
• Realizability models for a linear dependent PCF
• On linear Brouwerian logics
• Matching of bounded set terms in the logic language LDL++
• scientific article; zbMATH DE number 1231523 (Why is no real title available?)
• scientific article; zbMATH DE number 1231527 (Why is no real title available?)
• Linearity Constraints as Bounded Intervals in Linear Logic Programming
• Bounded linear logic, revisited
• Bounded Linear Logic, Revisited
• Towards logical foundations for probabilistic computation
• Curry and Howard meet Borel

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902142)