On typing delimited continuations: Three new solutions to the printf problem

Higher-Order and Symbolic Computation

Volumn 22, Issue 3, 2009, Pages 275-291

  Asai, Kenichi ^a  

^a OCHANOMIZU UNIVERSITY   (Japan)

Author keywords

Continuation passing style (CPS); Delimited continuations; Direct style; Printf; Types

Indexed keywords

CONTINUATION-PASSING STYLE; CONTROL OPERATORS; DEPENDENT TYPES; KEY ISSUES; KEY TECHNIQUES; NEW APPLICATIONS; NEW SOLUTIONS; SHIFT-AND; TAIL CALLS; TYPE SYSTEMS;

JAVA PROGRAMMING LANGUAGE;

EID: 77954761484     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10990-009-9049-5     Document Type: Article

References (15)

1. Asai, K., Kameyama, Y.: Polymorphic delimited continuations. In: 5th Asian Symposium on Programming Languages and Systems, APLAS 2007. Lecture Notes in Computer Science, vol. 4807, pp. 239-254. Springer, Berlin (2007)
2. Danvy, O.: Back to direct style. Sci. Comput. Program. 22 (3), 183-195 (1994)
3. Danvy, O.: Functional unparsing. J. Funct. Program. 8 (6), 621-625 (1998)
4. Danvy, O., Filinski, A.: A functional abstraction of typed contexts. Tech. Rep. 89/12, DIKU, University of Copenhagen (1989)
5. Danvy, O., Filinski, A.: Abstracting control. In: LFP '90: Proceedings of the 1990 ACM Conference on LISP and Functional Programming, pp. 151-160. ACM Press, New York (1990)
6. Danvy, O., Filinski, A.: Representing control, a study of the CPS transformation. Math. Struct. Comput. Sci. 2 (4), 361-391 (1992)
7. Danvy, O., Hatcliff, J.: On the transformation between direct and continuation semantics. In: Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics. Lecture Notes in Computer Science, vol. 802, pp. 627-648. Springer, Berlin (1993)
8. Filinski, A.: Representing monads. In: POPL '94: Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 446-457. ACM Press, New York (1994)
9. Hinze, R.: Formatting: A class act. J. Funct. Program. 13 (5), 935-944 (2003)
10. Kameyama, Y., Hasegawa, M.: A sound and complete axiomatization of delimited continuations. In: ICFP '03: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pp. 177-188. ACM Press, New York (2003)
11. Plotkin, G. D.: Call-by-name, call-by-value, and the λ?-calculus. Theor. Comput. Sci. 1 (2), 125-159 (1975)
12. Steele, G. L.: RABBIT: A compiler for SCHEME. Tech. Rep. AI-TR-474, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA (1978)
13. Strachey, C., Wadsworth, C. P.: Continuations: A Mathematical Semantics for Handling Full Jumps. Technical Monograph PRG-11, Oxford University Computing Laboratory, Programming Research Group, Oxford, England (1974). Reprinted in Higher-Order Symb. Comput. 13 (1/2), 135-152 (2000)
14. Thielecke, H.: From control effects to typed continuation passing. In: POPL '03: Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 139-149. ACM Press, New York (2003)
15. Thielecke, H.: Answer type polymorphism in call-by-name continuation passing. In: 13th European Symposium on Programming, ESOP 2004. Lecture Notes in Computer Science, vol. 2986, pp. 279-293. Springer, Berlin (2004)