The following pages link to (Q4945245):
Displaying 11 items.
- Light linear logics with controlled weakening: expressibility, confluent strong normalization (Q408540) (← links)
- Type inference for light affine logic via constraints on words (Q703485) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- A semantic proof of polytime soundness of light affine logic (Q987375) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Soft linear logic and polynomial time (Q1827397) (← links)
- On an interpretation of safe recursion in light affine logic (Q1827399) (← links)
- A type-assignment of linear erasure and duplication (Q2193281) (← 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)