Soft linear logic and polynomial time
From MaRDI portal
Publication:1827397
Cites work
- scientific article; zbMATH DE number 42059 (Why is no real title available?)
- scientific article; zbMATH DE number 786495 (Why is no real title available?)
- scientific article; zbMATH DE number 1392281 (Why is no real title available?)
- scientific article; zbMATH DE number 1424054 (Why is no real title available?)
- Bounded linear logic: A modular approach to polynomial-time computability
- Interaction combinators
- Light linear logic
- Linear logic
- The structure of multiplicatives
Cited in
(54)- Exponentially handsome proof nets and their normalization
- Super exponentials in linear logic
- Exponentials as substitutions and the cost of cut elimination in linear logic
- DisCoCat for Donkey Sentences
- Light types for polynomial time computation in lambda calculus
- Gödel's system \(\mathcal T\) revisited
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization
- Bounded combinatory logic and lower complexity
- The role of polymorphism in the characterisation of complexity by soft types
- Jump from parallel to sequential proofs: exponentials
- Realizability models and implicit complexity
- A Short Introduction to Implicit Computational Complexity
- Parsing/theorem-proving for logical grammar \textit{CatLog3}
- Unary resolution: characterizing \textsc{Ptime}
- Soft subexponentials and multiplexing
- Linear logic by levels and bounded time complexity
- Quantum implicit computational complexity
- Characterizingco-NLby a group action
- Implicit computation complexity in higher-order programming languages
- Read/write factorizable programs
- Polynomial time in untyped elementary linear logic
- A Characterization of NC k by First Order Functional Programs
- Soft linear logic and polynomial complexity classes
- Natural language semantics and computability
- Computational Complexity Via Finite Types
- Light linear logics with controlled weakening: expressibility, confluent strong normalization
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy
- Taming Modal Impredicativity: Superlazy Reduction
- On paths-based criteria for polynomial time complexity in proof-nets
- Causal computational complexity of distributed processes
- Type Inference for a Polynomial Lambda Calculus
- Soft linear set theory
- Light Linear Logic with Controlled Weakening
- Bounded Linear Logic, Revisited
- Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials
- A Splitting Algorithm Based on Soft Constraints for the Computation of Truth Degree in Quantitative Logic
- A type-assignment of linear erasure and duplication
- Linear and affine logics with temporal, spatial and epistemic operators
- Normal modal substructural logics with strong negation
- Infinitary action logic with multiplexing
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
- A By-Level Analysis of Multiplicative Exponential Linear Logic
- Light logics and higher-order processes
- On session types and polynomial time
- Type inference for light affine logic via constraints on words
- An abstract approach to stratification in linear logic
- On quantum lambda calculi: a foundational perspective
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time
- Towards a theory of resource: an approach based on soft exponentials
- Linear Logic Properly Displayed
- Linear logical relations and observational equivalences for session-based concurrency
- Phase semantics and decidability of elementary affine logic
- A semantic proof of polytime soundness of light affine logic
- The decidability of the intensional fragment of classical linear logic
This page was built for publication: Soft linear logic and polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827397)
