Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
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 M. Cheng
IT Professional
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems