A simple proof of a folklore theorem about delimited control

Journal of Functional Programming

Volumn 16, Issue 3, 2006, Pages 269-280

  Biernacki, Dariusz ^a   Danvy, Olivier ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

OPERATIONAL SEMANTICS; SHIFT-AND;

FUNCTIONAL PROGRAMMING;

THEOREM PROVING;

EID: 33646390435     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796805005782     Document Type: Article

References (17)

1. Ariola, Z. M., Herbelin, H. and Sabry, A. (2004) A type-theoretic foundation of continuations and prompts. In: Fisher, K. (editor), Proceedings of the 2004 ACM SIGPLAN International Conference on Functional Programming, pp. 40-53. ACM Press.
2. Biernacka, M., Biernacki, D. and Danvy, O. (2005) An operational foundation for delimited continuations in the CPS hierarchy. Research Report BRICS RS-05-24. DAIMI, Department of Computer Science, University of Aarhus, Denmark.
3. (To appear in Logical Methods in Computer Science. A preliminary version was presented at the Fourth ACM SIGPLAN Workshop on Continuations (CW 2004).)
4. Biernacki, D., Danvy, O. and Millikin, K. (2005) A dynamic continuation-passing style for dynamic delimited continuations. Research Report BRICS RS-05-16. DAIMI, Department of Computer Science, University of Aarhus, Denmark.
5. Danvy, O. and Filinski, A. (1990) Abstracting control. In: Wand, M. (editor), Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pp. 151-160. Nice, France. ACM Press.
6. Dybvig, R. K., Peyton-Jones, S. and Sabry, A. (2005) A monadic framework for subcontinuations. Technical Report 615. Computer Science Department, Indiana University, Bloomington, Indiana.
7. Felleisen, M. (1988) The theory and practice of first-class prompts. In: Ferrante, J. and Mager, P. (editors), Proceedings of the 15th Annual ACM Symposium on Principles of Programming Languages, pp. 180-190. San Diego, CA. ACM Press.
8. Felleisen, M. and Friedman, D. P. (1986) Control operators, the SECD machine, and the λ-calculus. In: Wirsing, M. (editor). Formal Description of Programming Concepts III, pp. 193-217. North-Holland.
9. Felleisen, M., Wand, M., Friedman, D. P. and Duba, B. F. (1988) Abstract continuations: A mathematical semantics for handling full functional jumps. In: Cartwright, R. (Corky) (editor), Proceedings of the 1988 ACM Conference on Lisp and Functional Programming, pp. 52-62. Snowbird, UT. ACM Press.
10. Gasbichler, M. and Sperber, M. (2002) Final shift for call/cc: direct implementation of shift and reset. In: Peyton Jones, S. (editor), Proceedings of the 2002 ACM SIGPLAN International Conference on Functional Programming, pp. 271-282. Pittsburgh, PA. ACM Press.
11. (SIGPLAN Notices, 37(9).)
12. Kameyama, Y. and Hasegawa, M. (2003) A sound and complete axiomatization of delimited continuations. In: Shivers, O. (editor), Proceedings of the 2003 ACM SIGPLAN International Conference on Functional Programming, pp. 177-188. Uppsala, Sweden. ACM Press.
13. 5 report on the algorithmic language Scheme. Higher-order & Symbolic Computation, 11(1), 7-105.
14. Kiselyov, O. (2005) How to remove a dynamic prompt: Static and dynamic delimited continuation operators are equally expressible. Technical Report 611. Computer Science Department, Indiana University, Bloomington, Indiana.
15. Milne, R. E. and Strachey, C. (1976) A Theory of Programming Language Semantics. Chapman & Hall, London, and John Wiley, New York.
16. Plotkin, G. D. (1975) Call-by-name, call-by-value and the λ-calculus. Theor. Comput. Sci. 1, 125-159.
17. Shan, C.-c. (2004) Shift to control. In: Shivers, O. and Waddell, O. (editors), Proceedings of the 2004 ACM SIGPLAN Workshop on Scheme and Functional Programming. Technical report TR600, Computer Science Department, Indiana University.