Pages that link to "Item:Q627123"
From MaRDI portal
The following pages link to Light logics and optimal reduction: completeness and complexity (Q627123):
Displaying 11 items.
- (Optimal) duplication is not elementary recursive (Q1881231) (← links)
- (In)efficiency and reasonable cost models (Q2333310) (← links)
- Light logics and higher-order processes (Q2971072) (← links)
- On quantum lambda calculi: a foundational perspective (Q2973238) (← links)
- (Q4681363) (← links)
- Plugging-in proof development environments using<i>Locks</i>in<tt>LF</tt> (Q4691186) (← links)
- (Q4945245) (← links)
- Is the Optimal Implementation Inefficient? Elementarily Not (Q5111313) (← links)
- Typed Lambda Calculi and Applications (Q5704029) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
- Theoretical Computer Science (Q5897362) (← links)