Shifting the stage: Staging with delimited control

Proceedings of the 2009 ACM SIGPLAN Symposium on Partial Evaluation and Program Manipulation, PEPM'09

Volumn , Issue , 2009, Pages 111-120

  Kameyama, Yukiyoshi ^a   Kiselyov, Oleg ^b   Shan, Chung Chieh ^c  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b FNMOC ^*  (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Code generation; Continuations; Delimited control; Design; Languages; Multilevel languages; Mutable state; Side effects; Staged programming

Indexed keywords

CODE GENERATION; CONTINUATIONS; DELIMITED CONTROL; LANGUAGES; MULTILEVEL LANGUAGES; MUTABLE STATE; SIDE EFFECTS; STAGED PROGRAMMING;

AUTOMATIC PROGRAMMING; COMPUTER SOFTWARE REUSABILITY; COMPUTER SOFTWARE SELECTION AND EVALUATION; DYNAMIC PROGRAMMING; JAVA PROGRAMMING LANGUAGE; NETWORK COMPONENTS; NUMERICAL METHODS; PROGRAM COMPILERS; REUSABILITY; SYSTEMS ENGINEERING; TEXTBOOKS;

LINGUISTICS;

EID: 67650652691     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1480945.1480962     Document Type: Conference Paper

References (47)

1. Asai, Kenichi, and Yukiyoshi Kameyama. 2007. Polymorphic delimited continuations. In APLAS, 239-254. LNCS 4807.
2. Bondorf, Anders. 1992. Improving binding times without explicit CPS-conversion. In Lisp & functional programming, 1-10.
3. Bondorf, Anders, and Olivier Danvy. 1991. Automatic autoprojection of recursive equations with global variables and abstract data types. Science of Computer Programming 16(2):151-195.
4. Calcagno, Cristiano, Eugenio Moggi, and Walid Taha. 2000. Closed types as a simple approach to safe imperative multi-stage programming. In ICALP, 25-36. LNCS 1853.
5. Carette, Jacques, and Oleg Kiselyov. 2008. Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code. Science of Computer Programming.
6. Cohen, Albert, Sébastien Donadio, María Jesús Garzarán, Christoph Armin Herrmann, Oleg Kiselyov, and David A. Padua. 2006. In search of a program generator to implement generic transformations for high-performance computing. Science of Computer Programming 62(1):25-46. (Pubitemid 43974824)
7. Czarnecki, Krzysztof, John T. O'Donnell, Jörg Striegnitz, and Walid Taha. 2004. DSL implementation in MetaOCaml, Template Haskell, and C++. In DSPG 2003, 51-72. LNCS 3016. (Pubitemid 38803766)
8. Danvy, Olivier, and Andrzej Filinski. 1989. A functional abstraction of typed contexts. Tech. Rep. 89/12, DIKU, University of Copenhagen, Denmark. http://www.daimi.au.dk/~danvy/Papers/fatc.ps.gz.
9. 1990. Abstracting control. In Lisp & functional programming,151-160.
10. 1992. Representing control: A study of the CPS transformation. Mathematical Structures in Computer Science 2(4): 361-391.
11. Davies, Rowan. 1996. A temporal logic approach to binding-time analysis. In LICS, 184-195.
12. Eckhardt, Jason, Roumen Kaiabachev, Emir Pašalić, Kedar N. Swadi, and Walid Taha. 2005. Implicitly heterogeneous multistage programming. In GPCE, 275-292. LNCS 3676.
13. Elliott, Conal. 2004. Programming graphics processors functionally. In Haskell workshop, 45-56.
14. Felleisen, Matthias, and Daniel P. Friedman. 1987. A reduction semantics for imperative higher-order languages. In PARLE: Parallel architectures and languages Europe. Volume II: Parallel languages, 206-223. LNCS 259.
15. Filinski, Andrzej. 1994. Representing monads. In POPL, 446-457.
16. Frigo, Matteo, and Steven G. Johnson. 2005. The design and implementation of FFTW3. Proceedings of the IEEE 93(2):216-231. (Pubitemid 40851223)
17. Gomard, Carsten K., and Neil D. Jones. 1991. A partial evaluator for the untyped lambda calculus. Journal of Functional Programming 1(1):21-69.
18. Hammond, Kevin, and Greg Michaelson. 2003. Hume: A domainspecific language for real-time embedded systems. In GPCE, 37-56. LNCS 2830.
19. Kameyama, Yukiyoshi, Oleg Kiselyov, and Chung-chieh Shan. 2008. Closing the stage: From staged code to typed closures. In PEPM, 147-157.
20. Kiselyov, Oleg. 2006. Native delimited continuations in (byte-code) OCaml. http://okmij.org/ftp/Computation/Continuations.html#caml-shift.
21. Kiselyov, Oleg, Chung-chieh Shan, and Amr Sabry. 2006. Delimited dynamic binding. In ICFP, 26-37.
22. Kiselyov, Oleg, and Walid Taha. 2005. Relating FFTW and splitradix. In ICESS, 488-493. LNCS 3605.
23. Lawall, Julia L., and Olivier Danvy. 1994. Continuation-based partial evaluation. In Lisp & functional programming, 227-238.
24. Lengauer, Christian, and Walid Taha, eds. 2006. Special issue on the 1st MetaOCaml workshop (2004), vol.62(1) of Science of Computer Programming.
25. Leroy, Xavier, and François Pessaux. 2000. Type-based analysis of uncaught exceptions. ACM Transactions on Programming Languages and Systems 22(2):340-377.
26. McAdam, Bruce J. 2001. Y in practical programs. Workshop on fixed points in computer science; http://www.dsi.uniroma1.it/~labella/absMcAdam.ps.
27. MetaOCaml. 2006. MetaOCaml. http://www.metaocaml.org.
28. Michie, Donald. 1968. "Memo" functions and machine learning. Nature 218:19-22.
29. Moreau, Luc. 1998. A syntactic theory of dynamic binding. Higher-Order and Symbolic Computation 11(3):233-279. (Pubitemid 128513564)
30. Nielson, Flemming, and Hanne Riis Nielson. 1988. Automatic binding time analysis for a typed λ-calculus. In POPL, 98-106.
31. 1992. Two-level functional languages. Cambridge University Press.
32. Parigot, Michel. 1992. λμ-calculus: An algorithmic interpretation of classical natural deduction. In LPAR, 190-201. LNAI 624.
33. Pašalíc, Emir, Walid Taha, and Tim Sheard. 2002. Tagless staged interpreters for typed languages. In ICFP, 157-166.
34. Peyton Jones, Simon L. 2003. The Haskell 98 language and libraries. Journal of Functional Programming 13(1):1-255.
35. Püschel, Markus, José M. F. Moura, Jeremy Johnson, David Padua, Manuela Veloso, Bryan W. Singer, Jianxin Xiong, Franz Franchetti, Aca Gačić, Yevgen Voronenko, Kang Chen, Robert W. Johnson, and Nick Rizzolo. 2005. SPIRAL: Code generation for DSP transforms. Proceedings of the IEEE 93(2): 232-275.
36. Soørensen, Morten Heine B., Robert Glück, and Neil D. Jones. 1994. Towards unifying deforestation, supercompilation, partial evaluation, and generalized partial computation. In ESOP, 485-500. LNCS 788.
37. Sumii, Eijiro, and Naoki Kobayashi. 2001. A hybrid approach to online and offline partial evaluation. Higher-Order and Symbolic Computation 14(2-3):101-142.
38. Swadi, Kedar, Walid Taha, and Oleg Kiselyov. 2005. Dynamic programming benchmark. http://www.metaocaml.org/examples/dp/.
39. Swadi, Kedar, Walid Taha, Oleg Kiselyov, and Emir Pašalić. 2006. A monadic approach for avoiding code duplication when staging memoized functions. In PEPM, 160-169. (Pubitemid 46946409)
40. Taha, Walid. 2000. A sound reduction semantics for untyped CBN multi-stage computation. In PEPM, 34-43.
41. 2005. Resource-aware programming. In ICESS, 38-43. LNCS 3605.
42. Taha, Walid, and Michael Florentin Nielsen. 2003. Environment classifiers. In POPL, 26-37.
43. Talpin, Jean-Pierre, and Pierre Jouvelot. 1992. Polymorphic type, region and effect inference. Journal of Functional Programming 2(3):245-271.
44. Thielecke, Hayo. 2003. From control effects to typed continuation passing. In POPL, 139-149.
45. Thiemann, Peter. 1999. Combinators for program generation. Journal of Functional Programming 9(5):483-525.
46. Thiemann, Peter, and Dirk Dussart. 1999. Partial evaluation for higher-order languages with state. http://www.informatik.uni-freiburg.de/ ~thiemann/papers/mlpe.ps.gz.
47. Wadler, Philip L. 1992. Comprehending monads. Mathematical Structures in Computer Science 2(4):461-493.