The following pages link to Distilling abstract machines (Q2819700):
Displaying 20 items.
- Proof nets and the call-by-value \(\lambda\)-calculus (Q897928) (← links)
- The spirit of node replication (Q2233421) (← links)
- (In)efficiency and reasonable cost models (Q2333310) (← links)
- On the value of variables (Q2401632) (← links)
- Classical By-Need (Q2802497) (← links)
- Reasoning About Call-by-need by Means of Types (Q2811356) (← links)
- The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus (Q2820681) (← links)
- Unification for $$\lambda $$ -calculi Without Propagation Rules (Q3179400) (← links)
- (Q4972738) (← links)
- The Negligible and Yet Subtle Cost of Pattern Matching (Q5056004) (← links)
- A Fresh Look at the λ-Calculus (Q5089000) (← links)
- Abstract machines, optimal reduction, and streams (Q5108536) (← links)
- (Q5111304) (← links)
- A strong call-by-need calculus (Q6135746) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
- Node Replication: Theory And Practice (Q6192004) (← links)
- A strong bisimulation for a classical term calculus (Q6563051) (← links)
- Reasonable space for the \(\lambda \)-calculus, logarithmically (Q6649482) (← links)
- Exponentials as substitutions and the cost of cut elimination in linear logic (Q6649484) (← links)
- Preorder-constrained simulations for program refinement with effects (Q6666773) (← links)
