On the call-by-value CPS transform and its semantics

Information and Computation

Volumn 188, Issue 2, 2004, Pages 241-283

  Führmann, Carsten ^a   Thielecke, Hayo ^b  

^a University of Bath   (United Kingdom)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

Categories; Continuations; Lambda calculus; Monads; Semantics

Indexed keywords

MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; SEMANTICS; SYNTACTICS;

CONTINUATION MODELS; LAMBDA CALCULUS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0742303621     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2003.08.001     Document Type: Article

References (33)

1. H. Abelson, R. Dybvig, C. Hayes, G. Rozas, N. Adams, D. Friedman, E. Kohlbecker, G. Steele, D. Bartley, R. Halstead, D. Oxley, G. Sussman, G. Brooks, C. Hanson, K. Pitman, M. Wand, Revised report on the algorithmic language scheme, Higher-order and Symbolic Computation 11 (1) (1998) 7-105.
2. A. W. Appel, Compiling with Continuations, Cambridge University Press, Cambridge, 1992.
3. G. Boudol, Pi-calculus in direct style, in: Symposium on Principles of Programming Languages (POPL'97). ACM, New York, 1997.
4. B. Duba, R. Harper, D. MacQueen, Typing first-class continuations in ML, in: Proc. ACM Symp. Principles of Programming Languages 1991, pp. 163-173.
5. M. Felleisen, D.P. Friedman, E.E. Kohlbecker, B. Duba, Reasoning with continuations, Proceedings of the Symposium on Logic in Computer Science (1986) 131-141.
6. A. Filinski, Declarative continuations: an investigation of duality in programming language semantics, in: D.H. Pitt (Ed.), et al., Category Theory and Computer Science, Lecture Notes in Computer Science, vol. 389, Springer-Verlag, 1989, pp. 224-249.
7. A. Filinski, Recursion from iteration, Lisp and Symbolic Computation 7 (1) (1994) 11-38.
8. M.J. Fischer, Lambda-calculus schemata, in: Proceedings ACM Conference on Proving Assertions about Programs, Los Cruces, 1972, pp. 104-109, sIGPLAN Notices, 7(1), January 1972.
9. C. Führman, Direct models of the computational lambda-calculus, in: Proceedings MFPS XV, Electronic Notes in Theoretical Computer Science, vol. 20, Elsevier, New Orleans, 1999.
10. C. Führmann, The structure of call-by-value, Ph.D. Thesis, Division of Informatics, University of Edinburgh, 2000.
11. C. Führmann, Varieties of effects, in: Proceedings of FOSSACS 2002, Lecture Notes in Computer Science, vol. 2303, Springer-Berlin, 2002, pp. 144-158.
12. T.G. Griffin, A formulae-as-types notion of control, in: Principles of Programming Languages (POPL '90), ACM, New York, 1990, 47-58.
13. M. Hasegawa, Y. Kakutani, Axioms for recursion in call-by-value, Higher-Order and Symbolic Computation 15 (2-3) (2002) 235-264.
14. J. Hatcliff, O. Danvy, Thunks and the λ-calculus, Journal of Functional Programming, 7 (2) (1997) 303-319.
15. M. Hofmann, Sound and complete axiomatisations of call-by-value control operators, Mathematical Structures in Computer Science 5 (1995) 461-482.
16. P.Z. Ingerman, Thunks: a way of compiling procedure statements with some comments on procedure declarations, Communications of the ACM 4 (1) (1961) 55-58.
17. P.J. Landin, A generalization of jumps and labels, Report, UNIVAC Systems Programming Research, Aug. 1965.
18. P.J. Landin, A generalization of jumps and labels, Higher-Order and Symbolic Computation 11 (2).
19. S.M. Lane, Categories for the Working Mathematician, Volume of Graduate Texts in Mathematics, Springer-Verlag, Berlin, 1971.
20. E. Moggi, Computational lambda-calculus and monads, Technical Report ECS-LFCS-88-66, Edinburgh Univ., Dept. of Comp. Sci., 1988.
21. E. Moggi, Computational lambda-calculus and monads, in: Proceedings 4th Annual IEEE Symp. on Logic in Computer Science, LICS'89, Pacific Grove, CA, USA, 5-8 June 1989, IEEE Computer Society Press, Washington, DC, 1989, pp. 14-23. Available from .
22. E. Moggi, Notions of computation and monads, Information and Computation 93 (1).
23. G.D. Plotkin, Call-by-name, call-by-value and the λ-calculus, Theoretical Computer Science 1 (2) (1975) 125-159.
24. J. Power, E. Robinson, Premonoidal categories and notions of computation, Mathematical Structures in Computer Science 7 (5) (1997) 453-468.
25. J. Power, H. Thielecke, Closed Freyd- and kappa-categories, in: Proc. ICALP '99, Lecture Notes in Computer Science, vol. 1644, Springer, Berlin, 1999.
26. J.C. Reynolds, The discoveries of continuations, Lisp and Symbolic Computation 6 (3/4) (1993) 233-247.
27. A. Sabry, M. Felleisen, Reasoning about programs in continuation-passing style, Lisp and Symbolic Computation 6 (3/4) (1993) 289-360.
28. P. Selinger, Control categories and duality: on the categorical semantics of the lambda-mu calculus, Mathematical Structures in Computer Science 11 (2001) 207-260.
29. G. Steele, Rabbit: A compiler for Scheme, AI Technical Report 474, MIT, May 1978.
30. C. Strachey, C.P. Wadsworth, Continuations: A Mathematical Semantics for Handling Full Jumps. Monograph PRG-11, Oxford University Computing Laboratory, Programming Research Group, Oxford, UK, 1974.
31. C. Strachey, C.P. Wadsworth, Continuations: a mathematical semantics for handling full jumps, Higher-Order and Symbolic Computation 13 (1/2) (2000) 135-152.
32. P. Taylor, Sober spaces and continuations, Theory and Applications of Categories 10.
33. H. Thielecke, Categorical structure of continuation passing style, Ph.D. Thesis, University of Edinburgh, 1997.