Recommendations
- Linear logic by levels and bounded time complexity
- Bounded linear logic: A modular approach to polynomial-time computability
- A polytime functional language from light linear logic
- Phase semantics for light linear logic
- Light linear logics with controlled weakening: expressibility, confluent strong normalization
Cited in
(42)- Light types for polynomial time computation in lambda calculus
- Linear logic by levels and bounded time complexity
- Bounded linear logic: A modular approach to polynomial-time computability
- Light linear logic
- Phase semantics for light linear logic
- Linear logic and elementary time
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
- Polynomial algorithm of limited propositional deduction
- Polynomial time in untyped elementary linear logic
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy
- An abstract approach to stratification in linear logic
- scientific article; zbMATH DE number 1670494 (Why is no real title available?)
- Soft linear logic and polynomial complexity classes
- Context semantics, linear logic, and computational complexity
- Rewriting with linear inferences in propositional logic
- Primal Infon Logic: Derivability in Polynomial Time
- A By-Level Analysis of Multiplicative Exponential Linear Logic
- On paths-based criteria for polynomial time complexity in proof-nets
- A polytime functional language from light linear logic
- Light Linear Logic with Controlled Weakening
- From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing
- Polynomial time calculi.
- scientific article; zbMATH DE number 3903964 (Why is no real title available?)
- scientific article; zbMATH DE number 176206 (Why is no real title available?)
- Light linear logics with controlled weakening: expressibility, confluent strong normalization
- scientific article; zbMATH DE number 1231574 (Why is no real title available?)
- Is there a logic for polynomial time?
- scientific article; zbMATH DE number 515724 (Why is no real title available?)
- The relational model is injective for multiplicative exponential linear logic (without weakenings)
- scientific article; zbMATH DE number 2061714 (Why is no real title available?)
- scientific article; zbMATH DE number 2182488 (Why is no real title available?)
- Light logics and higher-order processes
- Graded multicategories of polynomial-time realizers
- Realizability models and implicit complexity
- On light logics, uniform encodings and polynomial time
- Implicit computation complexity in higher-order programming languages
- Bounded linear logic, revisited
- On the computational complexity of cut-elimination in linear logic.
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Bounded Linear Logic, Revisited
- Light affine lambda calculus and polynomial time strong normalization
This page was built for publication: Linear logic and polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3419785)
