A reflection on call-by-value. (English) Zbl 1345.68086
Wexelblat, Richard L. (ed.), Proceedings of the 1st ACM SIGPLAN international conference on functional programming, ICFP ’96, Philadelphia, PA, USA, May 24–26, 1996. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-770-7). ACM SIGPLAN Notices 31, No. 6, 13-24 (1996).
MSC:
| 68N20 | Theory of compilers and interpreters |
| 68N18 | Functional programming and lambda calculus |
| 68N30 | Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) |
References:
| [1] | APPEL, A. Compiling with Continuations. Cambridge University Press, 1992. |
| [2] | ARIOLA, Z., FELLEISEN, M., MARAIST, J., ODERSKY, M., AND WADLER, P. A call-byneed lambda calculus. In A CM Symposium on Principles of Programming Languages (1995), pp. 233-246. 10.1145/199448.199507 |
| [3] | DAVEY, B. A., AND PmESTLEY, H. A. Introduction to Lattices and Order. Cambridge University Press, 1990. · Zbl 0701.06001 |
| [4] | FISCHER, M. Lambda calculus schemata. In A CM 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. 10.1007/BF01019461 |
| [5] | FLANAGAN, C., SABRY, A., DUBA, B., AND FELLEISEN, M. The essence of compiling with continuations, in A CM SIGPLAN Conference on Programming Language Design and Implementation (1993), pp. 237-247. 10.1145/155090.155113 |
| [6] | HATCLIFF, J., AND DANVY, O. A generic account of continuation-passing styles. In Proceedings of the 21th A CM Symposium on Principles of Programming Languages (1994), pp. 458-471. 10.1145/174675.178053 |
| [7] | KRANZ, D., ET AL. Orbit: An optimizing cornprier for Scheme. In A CM SIGPLAN Symposium on Compiler Construction (1986), SIG- PLAN Notices, 21, 7, pp. 219-233. 10.1145/13310.13333 |
| [8] | LANDIN, P. The mechanical evaluation of expressions. Computer Journal 6, 4 (1964), 308- 320. · Zbl 0122.36106 |
| [9] | LANE, S. M. Categories for the Working Mathematician. Springer-Verlag, 1971. · Zbl 0232.18001 |
| [10] | LAWALL, J., AND DANVY, O. Separating stages in the continuation-passing transform. In Proceedings of the 20th A CM Symposium on Principles of Programming Languages (1993), pp. 124-136. 10.1145/158511.158613 |
| [11] | MARAIST, J., ET AL. Call-by-name, call-byvalue, call-by-need and the linear lambda calculus. In Conference on Mathematical Foundations of Programming Semantics (1995). · Zbl 0908.03017 |
| [12] | MOGGI, E. Computational lambd -calculus and monads. Tech. Rep. ECS-LFCS-88-86, University of Edinburgh, 1988. |
| [13] | MOGGI, E. Computational lambda-calculus and monads. In Proceedings of the Symposium on Logic in Computer Science (1989), pp. 14- 23. · Zbl 0716.03007 |
| [14] | MOGGI, E. Notions of computation and monads. Information and Computation 93 (1991), 55-92. 10.1016/0890-5401(91)90052-4 · Zbl 0723.68073 |
| [15] | PLOTKIN, G. Call-by-name, call-by-value, and the A-calculus. Theoretical Computer Science i (1975), 125-159. · Zbl 0325.68006 |
| [16] | REYNOLDS, J. C. The discoveries of continuations. Lisp and Symbolic Computation 6, 3/4 (1993), 233-247. 10.1007/BF01019459 |
| [17] | SABR, A., AND FELLEISEN, M. Reasoning about programs in continuation-passing style. Lisp and Symbolic Computation 6, 3/4 (1993), 289-360. 10.1007/BF01019462 |
| [18] | STEELE, G. L. Rabbit: A compiler for Scheme. MIT AI Memo 474, Massachusetts Institute of Technology, 1978. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
