The following pages link to Linear logic and elementary time (Q1401946):
Displaying 28 items.
- Logarithmic space and permutations (Q276248) (← links)
- Bounded combinatory logic and lower complexity (Q276270) (← links)
- Phase semantics and decidability of elementary affine logic (Q596037) (← links)
- Type inference for light affine logic via constraints on words (Q703485) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time (Q1640980) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- Stratified coherence spaces: A denotational semantics for light linear logic (Q1827389) (← links)
- The additive multiboxes (Q1861326) (← links)
- Combining linear logic and size types for implicit complexity (Q1989323) (← links)
- Polynomial time in untyped elementary linear logic (Q1989326) (← 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)
- Unary Resolution: Characterizing Ptime (Q2811353) (← links)
- An Elementary Affine λ-Calculus with Multithreading and Side Effects (Q3007663) (← links)
- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets (Q3460508) (← links)
- (Q4580325) (← links)
- (Q5079730) (← links)
- (Q5092325) (← links)
- (Q5119390) (← links)
- Proofs, Reasoning and the Metamorphosis of Logic (Q5251186) (← links)
- Characterizing<b>co-NL</b>by a group action (Q5741572) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Bounded Linear Logic, Revisited (Q5902142) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
- Exponentials as substitutions and the cost of cut elimination in linear logic (Q6649484) (← links)
- Super exponentials in linear logic (Q6657784) (← links)
