Pages that link to "Item:Q1401943"
From MaRDI portal
The following pages link to Linear types and non-size-increasing polynomial time computation. (Q1401943):
Displaying 31 items.
- Higher-order interpretations and program complexity (Q276254) (← links)
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Safe recursion revisited. I: Categorical semantics for lower complexity (Q386608) (← links)
- Realizability models and implicit complexity (Q534712) (← links)
- Two algorithms in search of a type-system (Q733753) (← links)
- Unbounded recursion and non-size-increasing functions (Q737105) (← links)
- Gödel's system \(\mathcal T\) revisited (Q960861) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Implicit characterizations of FPTIME and NC revisited (Q1044672) (← links)
- Stratified coherence spaces: A denotational semantics for light linear logic (Q1827389) (← links)
- Realizability models for BLL-like languages (Q1827395) (← links)
- On an interpretation of safe recursion in light affine logic (Q1827399) (← links)
- Combining linear logic and size types for implicit complexity (Q1989323) (← links)
- Polynomial time over the reals with parsimony (Q2039933) (← links)
- Algorithmically broad languages for polynomial time and space (Q2148807) (← links)
- Types for complexity of parallel computation in pi-calculus (Q2233448) (← 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)
- Program equivalence in linear contexts (Q2346993) (← links)
- The Power of Closed Reduction Strategies (Q2866800) (← links)
- On quasi-interpretations, blind abstractions and implicit complexity (Q2909730) (← links)
- A Short Introduction to Implicit Computational Complexity (Q3166988) (← links)
- A Categorical Setting for Lower Complexity (Q3178259) (← links)
- Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets (Q3638260) (← links)
- (Q5079730) (← links)
- (Q5089032) (← links)
- Proof-Theoretic Semantics and Feasibility (Q5250217) (← links)
- Non-linearity as the Metric Completion of Linearity (Q5300890) (← links)
- Two decades of automatic amortized resource analysis (Q5875892) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Bounded Linear Logic, Revisited (Q5902142) (← links)
