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
Conference paper
Performance test case generation for microprocessors
Pradip Bose
VTS 1998
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
David S. Kung
DAC 1998