Research Article Open Access

Semantics of Lazy Evaluation using the Two-Level Grammar

Mahmoud A. AbouGhaly, Sameh S. Daoud, Azza A. Taha and Salwa M. Aly

Abstract

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.

Journal of Computer Science
Volume 4 No. 1, 2008, 21-29

DOI: https://doi.org/10.3844/jcssp.2008.21.29

Submitted On: 14 January 2008 Published On: 31 January 2008

How to Cite: AbouGhaly, M. A., Daoud, S. S., Taha, A. A. & Aly, S. M. (2008). Semantics of Lazy Evaluation using the Two-Level Grammar. Journal of Computer Science, 4(1), 21-29. https://doi.org/10.3844/jcssp.2008.21.29

  • 2,796 Views
  • 2,476 Downloads
  • 0 Citations

Download

Keywords

  • Heap
  • α conversion
  • partial application to functions