Pages that link to "Item:Q2946582"
From MaRDI portal
The following pages link to Context semantics, linear logic, and computational complexity (Q2946582):
Displayed 10 items.
- Towards a geometry of recursion (Q534710) (← links)
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time (Q1640980) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- Polynomial time in untyped elementary linear logic (Q1989326) (← links)
- Linear dependent types in a call-by-value scenario (Q2441513) (← links)
- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets (Q3460508) (← links)
- Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: <i>a minimalist approach</i> (Q4637628) (← links)
- (Q5015215) (← links)
- Is the Optimal Implementation Inefficient? Elementarily Not (Q5111313) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)