A reflection on call-by-value

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 31, Issue 6, 1996, Pages 13-24

  Sabry, Amr ^a,c   Wadler, Philip ^b  

^a UNIVERSITY OF OREGON   (United States)

^b UNIVERSITY OF GLASGOW   (United Kingdom)

^c CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17144371352     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/232629.232631     Document Type: Article

References (19)

1. APPEL, A. Compiling with Continuations. Cambridge University Press, 1992.
2. ARIOLA, Z., FELLEISEN, M., MARAIST, J., ODERSKY, M., AND WADLER, P. A call-by-need lambda calculus. In ACM Symposium on Principles of Programming Languages (1995), pp. 233-246.
3. DAVEY, B. A., AND PRIESTLEY, H. A. Introduction to Lattices and Order. Cambridge University Press, 1990.
4. FISCHER, M. Lambda calculus schemata. In ACM Conference on Proving Assertions about Programs (1972), SIGPLAN Notices, bf 7, 1, pp. 104-109. Revised version in Lisp and Symbolic Computation, 6, 3/4, (1993) 259-287.
5. FISCHER, M. Lambda calculus schemata. In ACM Conference on Proving Assertions about Programs (1972), SIGPLAN Notices, bf 7, 1, pp. 104-109. Revised version in Lisp and Symbolic Computation, 6, 3/4, (1993) 259-287.
6. FLANAGAN, C., SABRY, A., DUBA, B., AND FELLEISEN, M. The essence of compiling with continuations. In ACM SIGPLAN Conference on Programming Language Design and Implementation (1993), pp. 237-247.
7. HATCLIFF, J., AND DANVY, O. A generic account of continuation-passing styles. In Proceedings of the 21th ACM Symposium on Principles of Programming Languages (1994), pp. 458-471.
8. KRANZ, D., ET AL. Orbit: An optimizing compiler for Scheme. In ACM SIGPLAN Symposium on Compiler Construction (1986), SIGPLAN Notices, 21, 7, pp. 219-233.
9. LANDIN, P. The mechanical evaluation of expressions. Computer Journal 6, 4 (1964), 308-320.
10. LANE, S. M. Categories for the Working Mathematician. Springer-Verlag, 1971.
11. LAWALL, J., AND DANVY, O. Separating stages in the continuation-passing transform. In Proceedings of the 20th ACM Symposium on Principles of Programming Languages (1993), pp. 124-136.
12. MARAIST, J., ET AL. Call-by-name, call-by-value, call-by-need and the linear lambda calculus. In Conference on Mathematical Foundations of Programming Semantics (1995).
13. MOGGI, E. Computational lambda-calculus and monads. Tech. Rep. ECS-LFCS-88-86, University of Edinburgh, 1988.
14. MOGGI, E. Computational lambda-calculus and monads. In Proceedings of the Symposium on Logic in Computer Science (1989), pp. 14-23.
15. MOGGI, E. Notions of computation and monads. Information and Computation 93 (1991), 55-92.
16. PLOTKIN, G. Call-by-name, call-by-value, and the λ-calculus. Theoretical Computer Science 1 (1975), 125-159.
17. REYNOLDS, J. C. The discoveries of continuations. Lisp and Symbolic Computation 6, 3/4 (1993), 233-247.
18. SABRY, A., AND FELLEISEN, M. Reasoning about programs in continuation-passing style. Lisp and Symbolic Computation 6, 3/4 (1993), 289-360.
19. STEELE, G. L. Rabbit: A compiler for Scheme. MIT AI Memo 474, Massachusetts Institute of Technology, 1978.