| Lazy versus strict |
| Full text |
Pdf
(205 KB)
|
| Source
|
ACM Computing Surveys (CSUR)
archive
Volume 28 , Issue 2 (June 1996)
table of contents
Pages: 318 - 320
Year of Publication: 1996
ISSN:0360-0300
|
|
Author
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 6, Downloads (12 Months): 51, Citation Count: 0
|
|
|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
Zena M. Ariola , John Maraist , Martin Odersky , Matthias Felleisen , Philip Wadler, A call-by-need lambda calculus, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.233-246, January 23-25, 1995, San Francisco, California, United States
[doi> 10.1145/199448.199507]
|
| |
2
|
|
| |
3
|
|
| |
4
|
MARAIST, J., ODERSKY, M., TURNER, D. N., AND WADLER, P. 1995. Call-by-name, call-byvalue, call-by-need, and the linear lambda calculus. In Proceedings of the 11th International Conference on the Mathematical Foundations of Programming Semantics (New Orleans, LA, March).
|
| |
5
|
|
 |
6
|
|
| |
7
|
WADLER, P. 1995. How to declare an imperative. In Proceedings of the International Logic Programming Symposium (Portland, OR, Dec.), MIT Press, Cambridge, MA.
|
 |
8
|
|
|