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

The Qx-coder

M.J. Slattery, Joan L. Mitchell

IBM J. Res. Dev

Paper

Automated Learning of Decision Rules for Text Categorization

Chidanand Apté, Fred Damerau, et al.

ACM Transactions on Information Systems (TOIS)

Workshop paper

A framework for extensible collaborative asset-based service engagement

Fan Jing Meng, Ying Huang, et al.

ICEBE 2007

Conference paper

(1 + ε)-approximate sparse recovery

Eric Price, David P. Woodruff

FOCS 2011

View all publications

Abstract

Related

The Qx-coder

Automated Learning of Decision Rules for Text Categorization

A framework for extensible collaborative asset-based service engagement

(1 + ε)-approximate sparse recovery