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

Modeling polarization for Hyper-NA lithography tools and masks

Kafai Lai, Alan E. Rosenbluth, et al.

SPIE Advanced Lithography 2007

Paper

Improved fairness algorithms for rings with spatial reuse

Israel Cidon, Leonidas Georgiadis, et al.

IEEE/ACM Transactions on Networking

Conference paper

Automatic taxonomy generation: Issues and possibilities

Raghu Krishnapuram, Krishna Kummamuru

IFSA 2003

Paper

CODS: Evolving data efficiently and scalably in column oriented databases

Ziyang Liu, Sivaramakrishnan Natarajan, et al.

VLDB

View all publications

Abstract

Related

Modeling polarization for Hyper-NA lithography tools and masks

Improved fairness algorithms for rings with spatial reuse

Automatic taxonomy generation: Issues and possibilities

CODS: Evolving data efficiently and scalably in column oriented databases