A By-Level Analysis of Multiplicative Exponential Linear Logic
From MaRDI portal
Recommendations
- An analysis of (linear) exponentials based on extended sequents
- The undecidability of second order multiplicative linear logic
- Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
- An abstract approach to stratification in linear logic
- A semantic account of strong normalization in linear logic
Cites work
- Exact bounds for lengths of reductions in typed -calculus
- scientific article; zbMATH DE number 3853055 (Why is no real title available?)
- scientific article; zbMATH DE number 786493 (Why is no real title available?)
- scientific article; zbMATH DE number 970633 (Why is no real title available?)
- Light affine lambda calculus and polynomial time strong normalization
- Light linear logic
- Linear logic and polynomial time
- On the computational complexity of cut-elimination in linear logic.
- Soft linear logic and polynomial time
Cited in
(6)- An abstract approach to stratification in linear logic
- Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials
- Acyclicity and Coherence in Multiplicative Exponential Linear Logic
- scientific article; zbMATH DE number 517072 (Why is no real title available?)
- Implicit computation complexity in higher-order programming languages
- Simply typed convertibility is \textsc{Tower}-complete even for safe lambda-terms
This page was built for publication: A By-Level Analysis of Multiplicative Exponential Linear Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3182938)
