M.F. Cowlishaw
IBM Systems Journal
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
Preeti Malakar, Thomas George, et al.
SC 2012
Robert E. Donovan
INTERSPEECH - Eurospeech 2001
György E. Révész
Theoretical Computer Science