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

(1 + ε)-approximate sparse recovery

Eric Price, David P. Woodruff

FOCS 2011

Paper

Routing and Wavelength Assignment in All-Optical Networks

Rajiv Ramaswami, Kumar N. Sivarajan

IEEE/ACM Transactions on Networking

Paper

Evolutionary scheduling of dynamic multitasking workloads for big-data analytics in elastic cloud

Fan Zhang, Junwei Cao, et al.

IEEE TETC

Paper

Successive Refinement of Information

Thomas M. Cover

IEEE Trans. Inf. Theory

View all publications

Abstract

Related

(1 + ε)-approximate sparse recovery

Routing and Wavelength Assignment in All-Optical Networks

Evolutionary scheduling of dynamic multitasking workloads for big-data analytics in elastic cloud

Successive Refinement of Information