Research Article Open Access

Operational Semantics for Lazy Evaluation

Mahmoud A. Abou Ghaly1, Sameh S. Daoud2, Azza A. Taha2 and Salwa M. Aly2
  • 1 , Afganistan
  • 2 ,
Journal of Computer Science
Volume 3 No. 8, 2007, 639-645


Submitted On: 1 July 2007 Published On: 31 August 2007

How to Cite: Abou Ghaly, M. A., Daoud, S. S., Taha, A. A. & Aly, S. M. (2007). Operational Semantics for Lazy Evaluation. Journal of Computer Science, 3(8), 639-645.


An operational semantics for lazy evaluation of a calculus without higher order functions was defined. Although it optimizes many aspects of implementation, e.g. there is a sharing in the recursive computation, there is no α conversion, the heap is automatically reclaimed, and an attempt to evaluate an argument is done at most once. It is still suitable for reasoning about program behavior and proofs of program correctness; this is primarily due to the definition via inferences and axioms which allows for proofs by induction on the height of the proof tree. We also proved the correctness of this operational semantics by showing that it is equivalent with respect to the values calculated to the operational semantics of LAZY-PCF+SHAR due to S. Purushothaman Iyer and Jill Seaman.

  • 0 Citations



  • Higher order functions
  • α conversion