Author

Azza A. Taha

Ain Shams University, Egypt

3 articles in our journals

Articles where this person is an author, newest first. People are matched by their name as printed (no ORCID iD is recorded for them), not by name alone; search the name as text to find namesakes too.

Research ArticleOpen accessML-Style Multi-Abstraction Calculus with Type Inference AlgorithmAzza A. TahaML-style multi-abstraction calculus, …Journal of Computer Science, Vol. 15, Issue 5 · 31 May 2019 · 7,228 accessesView PDF Cite

Research ArticleOpen accessSemantics of Lazy Evaluation using the Two-Level GrammarMahmoud A. AbouGhaly, Sameh S. Daoud, Azza A. Taha, Salwa M. AlyWe 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 … …Journal of Computer Science, Vol. 4, Issue 1 · 31 Jan 2008 · 6,755 accessesView PDF Cite

Research ArticleOpen accessOperational Semantics for Lazy EvaluationMahmoud A. Abou Ghaly, Sameh S. Daoud, Azza A. Taha, Salwa M. AlyAn 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 … …Journal of Computer Science, Vol. 3, Issue 8 · 31 Aug 2007 · 6,705 accessesView PDF Cite