Thomas M. Cover
IEEE Trans. Inf. Theory
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
David A. Selby
IBM J. Res. Dev
Conference paper
A quantitative analysis of OS noise
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Gal Badishi, Idit Keidar, et al.
IEEE TDSC