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

Tight bounds for delay-sensitive aggregation

Yvonne Anne Pignolet, Stefan Schmid, et al.

Discrete Mathematics and Theoretical Computer Science

Paper

Advanced lithography kits: Serifs and hammerhead

Hang-Yip Liu, Steffen Schulze, et al.

Proceedings of SPIE - The International Society for Optical Engineering

Paper

Serving Deep Learning Models with Deduplication from Relational Databases

Lixi Zhou, Jiaqing Chen, et al.

VLDB

Conference paper

Semantic interoperability and transformation in enterprise integration

Raymond Wu, Jie Lu

ITA Conference 2007

View all publications

Abstract

Related

Tight bounds for delay-sensitive aggregation

Advanced lithography kits: Serifs and hammerhead

Serving Deep Learning Models with Deduplication from Relational Databases

Semantic interoperability and transformation in enterprise integration