Pages that link to "Item:Q877259"
From MaRDI portal
The following pages link to Light affine lambda calculus and polynomial time strong normalization (Q877259):
Displayed 8 items.
- Type inference for light affine logic via constraints on words (Q703485) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Quantum implicit computational complexity (Q1044836) (← links)
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)
- An Elementary Affine λ-Calculus with Multithreading and Side Effects (Q3007663) (← links)
- A Short Introduction to Implicit Computational Complexity (Q3166988) (← links)
- A By-Level Analysis of Multiplicative Exponential Linear Logic (Q3182938) (← links)
- Proof-Theoretic Semantics and Feasibility (Q5250217) (← links)