The following pages link to Theoretical Computer Science (Q5897348):
Displayed 11 items.
- The role of polymorphism in the characterisation of complexity by soft types (Q276263) (← links)
- Light linear logics with controlled weakening: expressibility, confluent strong normalization (Q408540) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Polynomial time in untyped elementary linear logic (Q1989326) (← links)
- A type-assignment of linear erasure and duplication (Q2193281) (← links)
- A By-Level Analysis of Multiplicative Exponential Linear Logic (Q3182938) (← links)
- Light Linear Logic with Controlled Weakening (Q3605533) (← links)
- Encodings of Turing machines in linear logic (Q5139286) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)