TY  - JOUR
AU  - AbouGhaly, Mahmoud A. 
AU  - Daoud, Sameh S. 
AU  - Taha, Azza A. 
AU  - Aly, Salwa M. 
PY  - 2008
TI  - Semantics of Lazy Evaluation using the Two-Level Grammar
JF  - Journal of Computer Science
VL  - 4
IS  - 1
DO  - 10.3844/jcssp.2008.21.29
UR  - https://thescipub.com/abstract/jcssp.2008.21.29
AB  - We have formalized the semantics of lazy evaluation for the lambda calculus using the two-level grammar formalism. The resulting semantics enjoys several properties, e.g., there is a sharing in the recursive computation, there is no α conversion, the heap is automatically reclaimed, an attempt to evaluate an argument is done at most once and there is a sharing in the evaluation of partial application to functions.