
- 1 ACM. Proceedings of the 1992 ACM Conference on Lisp and Functional Programming. LISP Pointers V, 1 (June 1992).Google Scholar
- 2 A2PEL, A.W. Compiling with Continuations. Cambridge University Press, New York, 1992. Google Scholar
- 3 BURN, G., AND LE M}~TAYER, D.L. Proving the correctness of compiler optimisations based on a global program analysis. Tech. Rep. Doc 92/20, Dept. of Computing, Imperial College of Science, Technology and Medicine, London, 1992.Google Scholar
- 4 DANVY, O. Back to direct style. In Proceedings of the 4th European Symposium on Programming, B. Krieg-Briickner, Ed. Lecture Notes in Computer Science, vol. 582. Springer-Verlag, New York, 1992, pp. 130-150. (Extended version to appear in Sci. Comput. Program.) Google Scholar
- 5 DANVY, O., AND FILINSKt, A. Representing control, a study of the CPS transformation. Math. Structures Comput. Sci. 2, 4, 361-391.Google Scholar
- 6 DANVY, O., AND HATCLIFF, J. Thunks (continued). In Proceedings of the Workshop on Static Analysis WSA'92. Bigre J. 81-82 (Sept. 1992), 3-11. (Extended version available as Tech. Rep. CIS-92-28, Kansas State Univ., Manhattan, 1992.)Google Scholar
- 7 DANVY, O., AND LAWALL, J.L. Back to direct style II: First-class continuations. In Proceed- ~ngs of the 1992 ACM Conference on Lisp and Functional Programming. LISP Pointers V, 1 (June 1992), 299-310. Google Scholar
- 8 DANVY, O., AND TALCOTT, C. L., EDS. Proceedings of the ACM SIGPLAN Workshop on Continuations. Tech. Rep. STAN-CS-92-1426, Stanford Univ., Calif., June 1992. Google Scholar
- 9 FILINSKI, A. Recursion from iteration. In Proceedings of the ACM SIGPLAN Workshop on Continuations, 0. Danvy and C. L. Talcott, Eds. Tech. Rep. STAN-CS-92-1426, Stanford Univ., Calif., June 1992, pp. 3-11.Google Scholar
- 10 FRADET, P., AND LE MI~TAYER, D. Compilation of functional languages by program transformation. A~CM Trans. Program. Lang. Syst. 13 (1991), 21-51. Google Scholar
- 11 INGERMAN, P.Z. Thunks, a way of compiling procedure statements with some comments on procedure declarations. Commun. ACM 4, 1 (Jan. 1961), 55-58. Google Scholar
- 12 KELSEY, R., AND HUDAK, P. Realistic compilation by program transformation. In Proceedings of the 16th Annual ACM Sympostum on Principles of Programming Languages (Austin, Tex., Jan.). ACM, New York, 1989, pp. 281-292. Google Scholar
- 13 MEYER, A. R., AND WAND, M. Continuation semantics in typed lambda-calculi (summary). In Logics of Programs--Proceedings, R. Parikh, Ed. Lecture Notes in Computer Science, vol. 193, Springer-Verlag, New York, 1985, pp. 219-224. Google Scholar
- 14 NIELSON, F., AND NIELSON, H.R. Two-Level Functional Languages. Cambridge Tracts in Theoretical Computer Science, vol. 34. Cambridge University Press, New York, 1992. Google Scholar
- 15 NIELSON, H. R., AND NIELSON, F. Semantics with Applications, a Formal Introduction. Wiley, New York, 1992. Google Scholar
- 16 OKASAKI, C., LEE, P., AND TARDITI, D. Graph reduction and lazy continuation-passing style. In Proceedings of the ACM SIGPLAN Workshop on Continuations, O. Danvy and C. L. Talcott, Eds. Tech. Rep. STAN-CS-92-1426, Stanford Univ., Calif., June 1992, pp. 91-101.Google Scholar
- 17 PEYTON JONES, S.L. The Implementation of Functional Programming Languages. Prentice- Hall International Series in Computer Science. Prentice-Hall, Englewood Cliffs, N.J., 1987. Google Scholar
- 18 PLOTKIN, G.D. Call-by-name, call-by-value and the A-calculus. Theor. Comput. Sci. 1 (1975), 125-159.Google Scholar
- 19 REYNOLDS, j. C. Definitional interpreters for higher-order programming languages, in Proceedings of 25th ACM National Conference (Boston, Ma~.). ACM, New York, 1972, pp. 717-740. Google Scholar
- 20 SABRY, A., AND FELLEISEN, M. Reasoning about programs in continuation-passing style. In Proceedings of the 1992 ACM Conference on Lisp and Functional Programming. LISP Pointers V, 1 (June 1992), 288-298. Google Scholar
- 21 SCHMtDT, D.A. Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, Boston, Mass., 1986. Google Scholar
- 22 STEELE, G. L., JR. Rabbit: A compiler for Scheme. Tech. Rep. AI-TR-474, Aiiificial Intelligence Lab., Massachusetts Institute of Technology, Cambridge, Mass., May 1978. Google Scholar
Index Terms
CPS-transformation after strictness analysis
Recommendations
The Bang Calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value
PPDP '16: Proceedings of the 18th International Symposium on Principles and Practice of Declarative ProgrammingWe introduce and study the Bang Calculus, an untyped functional calculus in which the promotion operation of Linear Logic is made explicit and where application is a bilinear operation. This calculus, which can be understood as an untyped version of ...
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operational side, we give big-step semantics and a stack machine for CBPV, which ...
Derivation and inference of higher-order strictness types
We extend an existing first-order typing system for strictness analysis to the fully higher-order case, covering both the derivation system and the inference algorithm. The resulting strictness typing system has expressive capabilities far beyond that ...








Comments