Pages that link to "Item:Q2900255"
From MaRDI portal
The following pages link to Call-by-Value Solvability, Revisited (Q2900255):
Displaying 24 items.
- A mechanism of function calls in MSVL (Q344760) (← links)
- Proof nets and the call-by-value \(\lambda\)-calculus (Q897928) (← links)
- System \(T\), call-by-value and the minimum problem (Q1274979) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- The bang calculus revisited (Q2039931) (← links)
- Implementing open call-by-value (Q2093145) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
- Open Call-by-Value (Q3179293) (← links)
- (Q4038678) (← links)
- (Q4411826) (← links)
- (Q4448358) (← links)
- Call-by-value Solvability (Q4953339) (← links)
- The Negligible and Yet Subtle Cost of Pattern Matching (Q5056004) (← links)
- (Q5076060) (← links)
- A Fresh Look at the λ-Calculus (Q5089000) (← links)
- Optimality and the linear substitution calculus (Q5111304) (← links)
- Head reduction and normalization in a call-by-value lambda-calculus (Q5240183) (← links)
- A Semantical and Operational Account of Call-by-Value Solvability (Q5410667) (← links)
- On reduction and normalization in the computational core (Q5879269) (← links)
- The bang calculus revisited (Q6116183) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
- Strong call-by-value and multi types (Q6605354) (← links)
- Light genericity (Q6629516) (← links)
- Exponentials as substitutions and the cost of cut elimination in linear logic (Q6649484) (← links)