The following pages link to The call-by-need lambda calculus (Q4236864):
Displaying 25 items.
- On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation (Q428886) (← links)
- A concurrent lambda calculus with futures (Q860851) (← links)
- On generic context lemmas for higher-order calculi with sharing (Q960863) (← links)
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi (Q964003) (← links)
- The spirit of node replication (Q2233421) (← links)
- On the value of variables (Q2401632) (← links)
- Classical By-Need (Q2802497) (← links)
- Reasoning About Call-by-need by Means of Types (Q2811356) (← links)
- Complete Laziness: a Natural Semantics (Q2873681) (← links)
- Minimality in a Linear Calculus with Iteration (Q2873683) (← links)
- Three Syntactic Theories for Combinatory Graph Reduction (Q3003482) (← links)
- Classical Call-by-Need and Duality (Q3007655) (← links)
- Small-step and big-step semantics for call-by-need (Q3648355) (← links)
- An abstract monadic semantics for value recursion (Q4659889) (← links)
- Purely functional lazy nondeterministic programming (Q4918241) (← links)
- The Negligible and Yet Subtle Cost of Pattern Matching (Q5056004) (← links)
- (Q5076059) (← links)
- A Fresh Look at the λ-Calculus (Q5089000) (← links)
- (Q5089007) (← links)
- (Q5091145) (← links)
- Rewriting and narrowing for constructor systems with call-time choice semantics (Q5410729) (← links)
- Rewriting and Call-Time Choice: The HO Case (Q5458434) (← links)
- A strong call-by-need calculus (Q6135746) (← links)
- Node Replication: Theory And Practice (Q6192004) (← links)
- Formal verifications of call-by-need and call-by-name evaluations with mutual recursion (Q6536314) (← links)
