Semantics of Lazy Evaluation using the Two-Level Grammar
Mahmoud A. AbouGhaly, Sameh S. Daoud, Azza A. Taha & Salwa M. Aly
Journal of Computer Science, Volume 4, Issue 1, pp. 21–29 · doi.org/10.3844/jcssp.2008.21.29
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.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2008 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
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
- Licence
- © Science Publications
- Issue
- Volume 4, Issue 1
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record