The call-by-need lambda calculus

John Maraist, Martin Odersky, Philip Wadler

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

ABSTRACT We present a calculus that captures the operational semantics of call-by-need. The call-by-need lambda calculus is confluent, has a notion of standard reduction, and entails the same observational equivalence relation as the call-by-name calculus. The system can be formulated with or without explicit let bindings, admits useful notions of marking and developments, and has a straightforward operational interpretation.
Original languageEnglish
Pages (from-to)275-317
Number of pages43
JournalJournal of Functional Programming
Issue number03
Publication statusPublished - 1998


Dive into the research topics of 'The call-by-need lambda calculus'. Together they form a unique fingerprint.

Cite this