Polymorphic delimited continuations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4807 LNCS, Issue , 2007, Pages 239-254

  Asai, Kenichi ^a   Kameyama, Yukiyoshi ^b  

^a OCHANOMIZU UNIVERSITY   (Japan)

^b UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Control operator; CPS translation; Delimited continuation; Predicative impredicative polymorphism; Type system

Indexed keywords

DATA STRUCTURES; POLYMORPHISM; TRANSLATION (LANGUAGES);

CONTROL OPERATORS; DELIMITED CONTINUATION; PREDICATIVE/IMPREDICATIVE POLYMORPHISM; TYPE SYSTEMS;

MATHEMATICAL OPERATORS;

EID: 38149013139     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76637-7_16     Document Type: Conference Paper

References (21)

1. Asai, K.: Logical Relations for Call-by-value Delimited Continuations. Trends in Functional Programming 6, 63-78 (2007)
2. Asai, K.: On Typing Delimited Continuations: Three New Solutions to the Printf Problem. See http://pllab.is.ocha.ac.jp/~asai/papers/ (submitted, 2007)
3. Asai, K., Kameyama, Y.: Polymorphic Delimited Continuations. Technical Report CS-TR-07-10, Dept. of Computer Science, University of Tsukuba (September 2007)
4. Danvy, O.: An Analytical Approach to Program as Data Objects. DSc thesis, Department of Computer Science, University of Aarhus, Aarhus, Denmark (2006)
5. Danvy, O., Filinski, A.: A Functional Abstraction of Typed Contexts. Technical Report 89/12, DIKU, University of Copenhagen (July 1989)
6. Danvy, O., Filinski, A.: Abstracting Control. In: Proc. 1990 ACM Conference on Lisp and Functional Programming, pp. 151-160 (1990)
7. Danvy, O., Filinski, A.: Representing Control: a Study of the CPS Transformation. Mathematical Structures in Computer Science 2(4), 361-391 (1992)
8. Filinski, A.: Representing Monads. In: POPL, pp. 446-457 (1994)
9. Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science, vol. 7. Cambridge University Press, Cambridge (1989)
10. Gunter, C.A., Remy, D., Riecke, J.G.: A Generalization of Exceptions and Control in ML-Like Languages. In: FPCA, pp. 12-23 (1995)
11. Harper, R., Duba, B.F., MacQueen, D.: Typing First-Class Continuations in ML. J. Funct. Program. 3(4), 465-484 (1993)
12. Harper, R., Lillibridge, M.: Explicit polymorphism and CPS conversion. In: POPL, pp. 206-219 (1993)
13. Hasegawa, M.: Relational parametricity and control. Logical Methods in Computer Science 2(3) (2006)
14. Kiselyov, O., Shan, C.-c., Sabry, A.: Delimited dynamic binding. In: ICFP, pp. 26-37 (2006)
15. Leroy, X.: Polymorphism by name for references and continuations. In: POPL, pp. 220-231 (1993)
16. Mogelberg, R.E., Simpson, A.: Relational parametricity for computational effects. In: LICS (2007)
17. Strachey, C.: Fundamental concepts in programming languages. International Summer School in Computer Programming, Copenhagen, Denmark (August 1967)
18. Thielecke, H.: From Control Effects to Typed Continuation Passing. In: POPL, pp. 139-149. ACM Press, New York (2003)
19. Tofte, M.: Type inference for polymorphic references. Inf. Comput. 89(1), 1-34 (1990)
20. Wright, A.K.: Simple imperative polymorphism. Lisp and Symbolic Computation 8(4), 343-355 (1995)
21. Wright, A.K., Felleisen, M.: A syntactic approach to type soundness. Inf. Comput. 115(1), 38-94 (1994)