S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
Paper
The semantics of lazy functional languages
Abstract
A denotational semantics for the λ-calculus is described. The semantics is continuation-based, and so reflects the order in which expressions are evaluated. It provides a means by which lazy functional languages can be better understood. © 1989.
Related
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Conference paper
Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003