Pages that link to "Item:Q1989323"
From MaRDI portal
The following pages link to Combining linear logic and size types for implicit complexity (Q1989323):
Displaying 5 items.
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
- Linear types and non-size-increasing polynomial time computation. (Q1401943) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068) (← links)
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)