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...
Uložené v:
| Vydané v: | Journal of functional programming Ročník 8; číslo 3; s. 275 - 317 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Cambridge University Press
01.05.1998
|
| ISSN: | 0956-7968, 1469-7653 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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. |
|---|---|
| Bibliografia: | ark:/67375/6GQ-P1X1ZBKQ-T istex:F659CB3DF6F64F9CB172F6BB46C0DF9AC4FBB62C PII:S0956796898003037 |
| ISSN: | 0956-7968 1469-7653 |
| DOI: | 10.1017/S0956796898003037 |