The following pages link to (Q2708316):
Displayed 15 items.
- Logarithmic space and permutations (Q276248) (← links)
- Interaction graphs: graphings (Q345705) (← links)
- Light logics and optimal reduction: completeness and complexity (Q627123) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Linear logic and elementary time (Q1401946) (← links)
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time (Q1640980) (← links)
- Stratified coherence spaces: A denotational semantics for light linear logic (Q1827389) (← 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)
- A structural approach to reversible computation (Q2581367) (← links)
- Unary Resolution: Characterizing Ptime (Q2811353) (← links)
- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets (Q3460508) (← links)
- (Q4580325) (← links)
- A correspondence between maximal abelian sub-algebras and linear logic fragments (Q4599613) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)