An abstract approach to stratification in linear logic
From MaRDI portal
Publication:2343125
DOI10.1016/j.ic.2014.10.006zbMath1408.03036arXiv1206.6504OpenAlexW2123092519MaRDI QIDQ2343125
Pierre Boudes, Damiano Mazza, Lorenzo Tortora de Falco
Publication date: 4 May 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.6504
Related Items
Proof theory for functional modal logic ⋮ Implicit computation complexity in higher-order programming languages
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The relational model is injective for multiplicative exponential linear logic (without weakenings)
- Linear logic
- *-autonomous categories. With an appendix by Po-Hsiang Chu
- Linear logic by levels and bounded time complexity
- Bounded linear logic: A modular approach to polynomial-time computability
- A new recursion-theoretic characterization of the polytime functions
- 2-sequent calculus: A proof theory of modalities
- The typed lambda-calculus is not elementary recursive
- The structure of multiplicatives
- Light linear logic
- Additives of linear logic and normalization. I: A (restricted) Church-Rosser property.
- Linear types and non-size-increasing polynomial time computation.
- LOGSPACE and PTIME characterized by programming languages
- Stratified coherence spaces: A denotational semantics for light linear logic
- Soft linear logic and polynomial time
- An arithmetic for polynomial-time computation
- A By-Level Analysis of Multiplicative Exponential Linear Logic
- Linear logic and polynomial time
- Quantitative Game Semantics for Linear Logic
- Data Types as Lattices
- An analysis of (linear) exponentials based on extended sequents
- Obsessional experiments for linear logic proof-nets
This page was built for publication: An abstract approach to stratification in linear logic
