Pages that link to "Item:Q1827399"
From MaRDI portal
The following pages link to On an interpretation of safe recursion in light affine logic (Q1827399):
Displaying 10 items.
- Light linear logics with controlled weakening: expressibility, confluent strong normalization (Q408540) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- Soft linear set theory (Q941435) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Light Linear Logic with Controlled Weakening (Q3605533) (← links)
- Some Complexity and Expressiveness Results on Multimodal and Stratified Proof Nets (Q3638260) (← links)
- Proof-Theoretic Semantics and Feasibility (Q5250217) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Bounded Linear Logic, Revisited (Q5902142) (← links)
