Pages that link to "Item:Q1827397"
From MaRDI portal
The following pages link to Soft linear logic and polynomial time (Q1827397):
Displaying 50 items.
- The role of polymorphism in the characterisation of complexity by soft types (Q276263) (← links)
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Light linear logics with controlled weakening: expressibility, confluent strong normalization (Q408540) (← links)
- Linear logical relations and observational equivalences for session-based concurrency (Q476190) (← links)
- Realizability models and implicit complexity (Q534712) (← links)
- Phase semantics and decidability of elementary affine logic (Q596037) (← links)
- Type inference for light affine logic via constraints on words (Q703485) (← links)
- Soft linear set theory (Q941435) (← links)
- Gödel's system \(\mathcal T\) revisited (Q960861) (← links)
- A semantic proof of polytime soundness of light affine logic (Q987375) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Quantum implicit computational complexity (Q1044836) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Normal modal substructural logics with strong negation (Q1425193) (← links)
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time (Q1640980) (← links)
- Polynomial time in untyped elementary linear logic (Q1989326) (← links)
- Soft subexponentials and multiplexing (Q2096472) (← links)
- Causal computational complexity of distributed processes (Q2112798) (← links)
- A type-assignment of linear erasure and duplication (Q2193281) (← links)
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)
- An abstract approach to stratification in linear logic (Q2343125) (← links)
- Linear and affine logics with temporal, spatial and epistemic operators (Q2368991) (← links)
- Parsing/theorem-proving for logical grammar \textit{CatLog3} (Q2425322) (← links)
- Natural language semantics and computability (Q2425328) (← links)
- The decidability of the intensional fragment of classical linear logic (Q2517231) (← links)
- Infinitary action logic with multiplexing (Q2698280) (← links)
- Unary Resolution: Characterizing Ptime (Q2811353) (← links)
- Soft Linear Logic and Polynomial Complexity Classes (Q2866738) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- Light logics and higher-order processes (Q2971072) (← links)
- On session types and polynomial time (Q2971079) (← links)
- On quantum lambda calculi: a foundational perspective (Q2973238) (← links)
- A Short Introduction to Implicit Computational Complexity (Q3166988) (← links)
- A By-Level Analysis of Multiplicative Exponential Linear Logic (Q3182938) (← links)
- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets (Q3460508) (← links)
- A Characterization of NC k by First Order Functional Programs (Q3502640) (← links)
- Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials (Q3532470) (← links)
- Taming Modal Impredicativity: Superlazy Reduction (Q3605525) (← links)
- Light Linear Logic with Controlled Weakening (Q3605533) (← links)
- Type Inference for a Polynomial Lambda Calculus (Q3638250) (← links)
- Towards a theory of resource: an approach based on soft exponentials (Q3647264) (← links)
- Jump from parallel to sequential proofs: exponentials (Q4577985) (← links)
- Characterizing<b>co-NL</b>by a group action (Q5741572) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Linear Logic Properly Displayed (Q5886520) (← links)
- Least and Greatest Fixed Points in Linear Logic (Q5892168) (← links)
- Bounded Linear Logic, Revisited (Q5902142) (← links)
- Read/write factorizable programs (Q6113488) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
