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 language | English |
---|---|
Pages (from-to) | 275-317 |
Number of pages | 43 |
Journal | Journal of Functional Programming |
Volume | 8 |
Issue number | 03 |
DOIs | |
Publication status | Published - 1998 |