The following pages link to Linear logic and polynomial time (Q3419785):
Displayed 10 items.
- Light linear logics with controlled weakening: expressibility, confluent strong normalization (Q408540) (← links)
- The relational model is injective for multiplicative exponential linear logic (without weakenings) (Q435194) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← 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 By-Level Analysis of Multiplicative Exponential Linear Logic (Q3182938) (← links)
- Light Linear Logic with Controlled Weakening (Q3605533) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)