The call-by-need lambda calculus
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 explici...
Saved in:
| Published in: | Journal of functional programming Vol. 8; no. 3; pp. 275 - 317 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Cambridge University Press
01.05.1998
|
| ISSN: | 0956-7968, 1469-7653 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| Bibliography: | ark:/67375/6GQ-P1X1ZBKQ-T istex:F659CB3DF6F64F9CB172F6BB46C0DF9AC4FBB62C PII:S0956796898003037 |
| ISSN: | 0956-7968 1469-7653 |
| DOI: | 10.1017/S0956796898003037 |