Pages that link to "Item:Q987375"
From MaRDI portal
The following pages link to A semantic proof of polytime soundness of light affine logic (Q987375):
Displaying 11 items.
- Realizability models and implicit complexity (Q534712) (← links)
- Phase semantics and decidability of elementary affine logic (Q596037) (← links)
- Realizability models for BLL-like languages (Q1827395) (← links)
- On an interpretation of safe recursion in light affine logic (Q1827399) (← links)
- Light affine set theory: A naive set theory of polynomial time (Q1876088) (← links)
- Quantitative classical realizability (Q2343127) (← links)
- Discreet games, light affine logic and PTIME computation (Q2753690) (← links)
- (Q4945245) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- A quantitative model for simply typed λ-calculus (Q5875894) (← links)
- Theoretical Computer Science (Q5897362) (← links)