A By-Level Analysis of Multiplicative Exponential Linear Logic

DOI10.1007/978-3-642-03816-7_30zbMath1250.03122OpenAlexW1828615284MaRDI QIDQ3182938

Luca Vercelli, Luca Roversi, Marco Gaboardi

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_30

Mathematics Subject Classification ID

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

Related Items (2)

An abstract approach to stratification in linear logic ⋮ Implicit computation complexity in higher-order programming languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Light affine lambda calculus and polynomial time strong normalization
• Light linear logic
• Soft linear logic and polynomial time
• Exact bounds for lengths of reductions in typed λ-calculus
• Linear logic and polynomial time
• Theoretical Computer Science

This page was built for publication: A By-Level Analysis of Multiplicative Exponential Linear Logic