Lazy and speculative execution in computer systems

  • Authors:
  • Butler Lampson

  • Affiliations:
  • Microsoft Research

  • Venue:
  • OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The distinction between lazy and eager (or strict) evaluation has been studied in programming languages since Algol 60s call by name, as a way to avoid unnecessary work and to deal gracefully with infinite structures such as streams. It is deeply integrated in some languages, notably Haskell, and can be simulated in many languages by wrapping a lazy expression in a lambda.