The following pages link to Giulio Guerrieri (Q2093144):
Displayed 24 items.
- Implementing open call-by-value (Q2093145) (← links)
- Decomposing probabilistic lambda calculi (Q2200818) (← links)
- Factorization in call-by-name and call-by-value calculi via linear logic (Q2233405) (← links)
- Proof-net as graph, Taylor expansion as pullback (Q2303597) (← links)
- Postponement of $\mathsf {raa}$ and Glivenko's theorem, revisited (Q2631646) (← links)
- Open Call-by-Value (Q3179293) (← links)
- (Q4600771) (← links)
- (Q5018484) (← links)
- (Q5076060) (← links)
- (Q5094132) (← links)
- (Q5149151) (← links)
- Head reduction and normalization in a call-by-value lambda-calculus (Q5240183) (← links)
- Standardization of a Call-By-Value Lambda-Calculus (Q5277841) (← links)
- (Q5369485) (← links)
- A Semantical and Operational Account of Call-by-Value Solvability (Q5410667) (← links)
- Glueability of resource proof-structures: inverting the Taylor expansion (Q5874211) (← links)
- On reduction and normalization in the computational core (Q5879269) (← links)
- Types by need (Q6070792) (← links)
- Types of fireballs (Q6166135) (← links)
- Postponement of raa and Glivenko's theorem, revisited (extended version) (Q6292974) (← links)
- Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus (Long Version) (Q6311689) (← links)
- Types by Need (Extended Version) (Q6314124) (← links)
- Glueability of resource proof-structures: inverting the Taylor expansion (long version) (Q6327394) (← links)
- Gluing resource proof-structures: inhabitation and inverting the Taylor expansion (Q6346667) (← links)