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.

Paper

Understanding crosstalk in high-resolution co or thin-film-transistor liquid crystal displays

Frank R. Libsch, S.C. Lien

IBM J. Res. Dev

Paper

Iterative Toeplitz solvers with local quadratic convergence

Elliot Linzer, M. Vetterli

Computing

Conference paper

(1 + ε)-approximate sparse recovery

Eric Price, David P. Woodruff

FOCS 2011

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

Understanding crosstalk in high-resolution co or thin-film-transistor liquid crystal displays

Iterative Toeplitz solvers with local quadratic convergence

(1 + ε)-approximate sparse recovery

HAG-based application layer multicast system for streaming media