The following pages link to Optimality and inefficiency (Q2817687):
Displaying 15 items.
- Light logics and optimal reduction: completeness and complexity (Q627123) (← links)
- The weak lambda calculus as a reasonable machine (Q930866) (← links)
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Coherence for sharing proof-nets (Q1398472) (← links)
- Proof nets, garbage, and computations (Q1589650) (← links)
- Lambda-calculus with director strings (Q1778107) (← links)
- Automated higher-order complexity analysis (Q1827392) (← links)
- Parallel beta reduction is not elementary recursive (Q1854460) (← links)
- (Optimal) duplication is not elementary recursive (Q1881231) (← links)
- (In)efficiency and reasonable cost models (Q2333310) (← links)
- Complete Laziness: a Natural Semantics (Q2873681) (← links)
- On the dynamics of sharing graphs (Q4571958) (← links)
- (Q5015378) (← links)
- Coherence for sharing proof nets (Q5055862) (← links)
- (Q5089006) (← links)
