Pages that link to "Item:Q1193854"
From MaRDI portal
The following pages link to Bounded linear logic: A modular approach to polynomial-time computability (Q1193854):
Displaying 50 items.
- Computation by interaction for space-bounded functional programming (Q276265) (← links)
- Light linear logics with controlled weakening: expressibility, confluent strong normalization (Q408540) (← links)
- Phase semantics and decidability of elementary affine logic (Q596037) (← links)
- Introduction to clarithmetic. I (Q642523) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- Soft linear set theory (Q941435) (← links)
- Gödel's system \(\mathcal T\) revisited (Q960861) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Normal functors, power series and \(\lambda\)-calculus (Q1103618) (← links)
- Natural deduction and coherence for weakly distributive categories (Q1126244) (← links)
- Decision problems for propositional linear logic (Q1192352) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- Linearizing intuitionistic implication (Q1210141) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Light linear logic (Q1271560) (← links)
- Semantics of weakening and contraction (Q1337357) (← links)
- The complexity of Horn fragments of linear logic (Q1337693) (← links)
- New Curry-Howard terms for full linear logic (Q1390952) (← links)
- Phase semantics for light linear logic (Q1398478) (← links)
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time (Q1640980) (← links)
- Realizability models for BLL-like languages (Q1827395) (← links)
- Soft linear logic and polynomial time (Q1827397) (← links)
- Petri nets, Horn programs, linear logic and vector games (Q1899147) (← links)
- Linear logic automata (Q1919766) (← links)
- A linear conservative extension of Zermelo-Fraenkel set theory (Q1919983) (← links)
- Simple free star-autonomous categories and full coherence (Q1936110) (← links)
- Resourceful program synthesis from graded linear types (Q2119110) (← links)
- Generalized bounded linear logic and its categorical semantics (Q2233407) (← links)
- Graded modal dependent type theory (Q2233475) (← links)
- Syllogisms in rudimentary linear logic, diagrammatically (Q2255209) (← links)
- An abstract approach to stratification in linear logic (Q2343125) (← links)
- Realizability models for a linear dependent PCF (Q2346992) (← links)
- Cut elimination for the unified logic (Q2367410) (← links)
- Linear dependent types in a call-by-value scenario (Q2441513) (← links)
- Scalar System F for Linear-Algebraic λ-Calculus: Towards a Quantum Physical Logic (Q2825375) (← links)
- On quantum lambda calculi: a foundational perspective (Q2973238) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- Quantum coherent spaces and linear logic (Q2998726) (← 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)
- A new “feasible” arithmetic (Q4532603) (← links)
- (Q4580325) (← links)
- (Q5019675) (← links)
- Modular Inference of Linear Types for Multiplicity-Annotated Arrows (Q5041106) (← links)
- Linear Dependent Type Theory for Quantum Programming Languages (Q5043587) (← links)
- (Q5141618) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Holomorphic models of exponential types in linear logic (Q5890062) (← links)
