Pages that link to "Item:Q3612618"
From MaRDI portal
The following pages link to From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing (Q3612618):
Displaying 6 items.
- Polynomial-time Martin-Löf type theory (Q688850) (← links)
- Type inference for light affine logic via constraints on words (Q703485) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic (Q3586061) (← links)
- From light logics to type assignments: a case study (Q3644842) (← links)