The semantics of lazy functional languages

Mark B. Josephs

doi:10.1016/0304-3975(89)90122-9

Theoretical Computer Science

Paper

16 Oct 1989

The semantics of lazy functional languages

View publication

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.

Conference paper

PIRE: A global living laboratory for cyberinfrastructure application enablement

S.M. Sadjadi, S. Chen, et al.

TAPIA 2009

Conference paper

Event matching using the transitive closure of dependency relations

Daniel M. Bikel, Vittorio Castelli

ACL 2008

Review

Data aggregation architectures for single-chip SDH/SONET framers

Rolf Clauberg

IBM J. Res. Dev

Paper

HAG-based application layer multicast system for streaming media

Ruixiong Tian, Zhe Xiang, et al.

Qinghua Daxue Xuebao/Journal of Tsinghua University

View all publications

Abstract

Related

PIRE: A global living laboratory for cyberinfrastructure application enablement

Event matching using the transitive closure of dependency relations

Data aggregation architectures for single-chip SDH/SONET framers

HAG-based application layer multicast system for streaming media