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

Fast geometric approximation techniques and geometric embedding problems

Marshall W. Bern, Howard J. Karloff, et al.

Theoretical Computer Science

Conference paper

A divide and conquer strategy for scaling weather simulations with multiple regions of interest

Preeti Malakar, Thomas George, et al.

SC 2012

Paper

Improved fairness algorithms for rings with spatial reuse

Israel Cidon, Leonidas Georgiadis, et al.

IEEE/ACM Transactions on Networking

Conference paper

Association control in mobile wireless networks

Minkyong Kim, Zhen Liu, et al.

INFOCOM 2008

View all publications

Abstract

Related

Fast geometric approximation techniques and geometric embedding problems

A divide and conquer strategy for scaling weather simulations with multiple regions of interest

Improved fairness algorithms for rings with spatial reuse

Association control in mobile wireless networks