A Reflection on Call-by-Value

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 6, 1997, Pages 916-941

  Sabry, Amr ^a   Wadler, Philip ^b  

^a UNIVERSITY OF OREGON   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Category theory; Compiling; Continuations; Galois connections; Languages; Theory

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS); FORMAL LANGUAGES; PROGRAM COMPILERS; PROGRAM PROCESSORS;

CALL BY VALUE; CATEGORY THEORY; COMPUTATIONAL LAMBDA CALCULUS; EQUATIONAL CORRESPONDENCE; GALOIS CONNECTIONS;

FORMAL LOGIC;

EID: 0031274017     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/267959.269968     Document Type: Article

References (27)

1. APPEL, A. W. 1992. Compiling with Continuations. Cambridge University Press, Cambridge, Mass.
2. ARIOLA, Z. M., FELLEISEN, M., MARAIST, J., ODERSKY, M., AND WADLER, P. 1995. A call-by-need lambda calculus. In the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, 233-246.
3. BARBER, A. 1995. Dual intuitionistic linear logic. Draft, Dept. of Computer Science, Univ. of Edinburgh, Edinburgh, U.K.
4. BENTON, N. AND WADLER, P. 1996. Linear logic, monads, and the lambda calculus. In the Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.
5. BENTON, P. N. 1995. A mixed linear and non-linear logic: Proofs, terms, and models. In Proceedings of Computer Science Logic (Kazimierz, Poland, 1994). Lecture Notes in Computer Science, vol. 933. Springer-Verlag, Berlin. Full version available as Tech. Rep. 352, Computer Laboratory, Univ. of Cambridge, October 1994.
6. DAVEY, B. A. AND PRIESTLEY, H. A. 1990. Introduction to Lattices and Order. Cambridge University Press, Cambridge, Mass.
7. FISCHER, M. 1972. Lambda calculus schemata. In Conference on Proving Assertions about Programs. SIGPLAN Not. 7, 1, 104-109. Revised version in Lisp and Symbolic Computation 6, 3/4 (1993), 259-287.
8. FISCHER, M. 1972. Lambda calculus schemata. In Conference on Proving Assertions about Programs. SIGPLAN Not. 7, 1, 104-109. Revised version in Lisp and Symbolic Computation 6, 3/4 (1993), 259-287.
9. FLANAGAN, C., SABRY, A., DUBA, B., AND FELLEISEN, M. 1993. The essence of compiling with continuations. In the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM Press, New York, 237-247.
10. GIRARD, J.-Y. 1987. Linear logic. Theoret. Comput. Sci. 50, 1-102.
11. HATCLIFF, J. AND DANVY, O. 1994. A generic account of continuation-passing styles. In the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, 458-471.
12. KRANZ D., KELSEY, R., REES, J., HUDAK, P., PHILBIN, J., AND ADAMS, N. 1986. Orbit: An optimizing compiler for Scheme. In the ACM SIGPLAN Symposium on Compiler Construction. SIGPLAN Not. 21, 7, 219-233.
13. LANDIN, P. 1964. The mechanical evaluation of expressions. Comput. J. 6, 4, 308-320.
14. LAWALL, J. AND DANVY, O. 1993. Separating stages in the continuation-passing transform. In the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, 124-136.
15. MAC LANE, S. 1971. Categories for the Working Mathematician. Springer-Verlag, Berlin.
16. MARAIST, J., ODERSKY, M., TURNER, D. N., AND WADLER, P. 1995. Call-by-name, call-by-value, call-by-need and the linear lambda calculus. In the International Conference on the Mathematical Foundations of Programming Semantics.
17. MELTON, A., SCHMIDT, D. A., AND STRECKER, G. 1985. Galois connections and computer science applications. In Category Theory and Computer Programming. Lecture Notes in Computer Science, vol. 240. Springer-Verlag, Berlin, 299-312.
18. MOGGI, E. 1988. Computational lambda-calculus and monads. Tech. Rep. ECS-LFCS-88-86, Univ. of Edinburgh, U.K.
19. MOGGI, E., 1989. Computational lambda-calculus and monads. In the Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 14-23.
20. MOGGI, E. 1991. Notions of computation and monads. Inf. Comput. 93, 55-92.
21. PLOTKIN, G. 1975. Call-by-name, call-by-value, and λ-calculus. Theoret. Comput. Sci. 1, 125-159.
22. REYNOLDS, J. C. 1993. The discoveries of continuations. Lisp Symbol. Comput. 6, 3/4, 233-247.
23. SABRY, A. AND FELLEISEN, M. 1993. Reasoning about programs in continuation-passing style. Lisp Symbol. Comput. 6, 3/4, 289-360.
24. SABRY, A. AND WADLER, P. 1996. A reflection on call-by-value. In SIGPLAN International Conference on Functional Programming. ACM Press, New York, 13-24.
25. STEELE, G. L. 1978. Rabbit: A compiler for Scheme. MIT AI Memo 474, Massachusetts Institute of Technology, Cambridge, Mass.
26. WADLER, P. 1993a. A syntax for linear logic. In the International Conference on the Mathematical Foundations of Programming Semantics. Lecture Notes in Computer Science, vol. 802. Springer-Verlag, Berlin.
27. WADLER, P. 1993b. A taste of linear logic (Invited talk). In Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 711. Springer-Verlag, Berlin.