Rolf Clauberg
IBM J. Res. Dev
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
Conference paper
Global routing revisited
Michael D. Moffitt
ICCAD 2009
Rafae Bhatti, Elisa Bertino, et al.
Communications of the ACM
Thomas R. Puzak, A. Hartstein, et al.
CF 2007