Semantics of Lazy Evaluation using the Two-Level Grammar
Mahmoud A. AbouGhaly, Sameh S. Daoud, Azza A. Taha and Salwa M. Aly
DOI : 10.3844/jcssp.2008.21.29
Journal of Computer Science
Volume 4, Issue 1
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.
© 2008 Mahmoud A. AbouGhaly, Sameh S. Daoud, Azza A. Taha and Salwa M. Aly. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.