Pages that link to "Item:Q5410667"
From MaRDI portal
The following pages link to A Semantical and Operational Account of Call-by-Value Solvability (Q5410667):
Displaying 28 items.
- Proof nets and the call-by-value \(\lambda\)-calculus (Q897928) (← links)
- System \(T\), call-by-value and the minimum problem (Q1274979) (← links)
- The bang calculus revisited (Q2039931) (← links)
- The spirit of node replication (Q2233421) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
- Call-By-Push-Value from a Linear Logic Point of View (Q2802478) (← links)
- Call-by-Value Solvability, Revisited (Q2900255) (← links)
- Open Call-by-Value (Q3179293) (← links)
- (Q3300796) (← links)
- (Q3484809) (← links)
- (Q4038678) (← links)
- (Q4411826) (← links)
- (Q4448358) (← links)
- (Q4580329) (← links)
- Call-by-value Solvability (Q4953339) (← links)
- (Q5076060) (← links)
- A Fresh Look at the λ-Calculus (Q5089000) (← links)
- Tight typings and split bounds, fully developed (Q5120229) (← links)
- Head reduction and normalization in a call-by-value lambda-calculus (Q5240183) (← links)
- On reduction and normalization in the computational core (Q5879269) (← links)
- Z property for the shuffling calculus (Q5879272) (← links)
- Extended call-by-push-value: reasoning about effectful programs and evaluation order (Q6091305) (← links)
- The bang calculus revisited (Q6116183) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
- Node Replication: Theory And Practice (Q6192004) (← 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)
