Lightweight modular staging: A pragmatic approach to runtime code generation and compiled DSLs

GPCE'10 - Proceedings of the 2010 Conference on Generative Programming and Component Engineering

Volumn , Issue , 2010, Pages 127-136

  Rompf, Tiark ^a   Odersky, Martin ^a  

^a EPFL   (Switzerland)

Author keywords

Code generation; Domain specific languages; Language virtualization; Multi stage programming

Indexed keywords

CODE GENERATION; COMPONENT TECHNOLOGIES; DOMAIN SPECIFIC; DOMAIN SPECIFIC LANGUAGES; EMBEDDED LANGUAGES; GENERATION PROCESS; GENERATIVE PROGRAMMING; HIGH-QUALITY PROGRAMS; MULTI-STAGE PROGRAMMING; OPTIMIZING COMPILERS; RUN-TIME CODE GENERATION; VIRTUALIZATIONS;

ABSTRACTING; NETWORK COMPONENTS; OPTIMIZATION; PROBLEM ORIENTED LANGUAGES; PROGRAM COMPILERS; SOFTWARE ENGINEERING; XML;

AUTOMATIC PROGRAMMING;

EID: 78650151869     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1868294.1868314     Document Type: Conference Paper

References (45)

1. O. Beckmann, A. Houghton, M. R. Mellor, and P. H. J. Kelly. Runtime code generation in c++ as a foundation for domain-specific optimisation. In Lengauer et al. [28], pages 291-306.
2. C. Calcagno, W. Taha, L. Huang, and X. Leroy. Implementing multistage languages using asts, gensym, and reflection. In F. Pfenning and Y. Smaragdakis, editors, GPCE, volume 2830 of Lecture Notes in Computer Science, pages 57-76. Springer, 2003.
3. J. Carette and O. Kiselyov. Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code. In R. Glück and M. R. Lowry, editors, GPCE, volume 3676 of Lecture Notes in Computer Science, pages 256-274. Springer, 2005.
4. J. Carette, O. Kiselyov, and C. chieh Shan. Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages. J. Funct. Program., 19(5):509-543, 2009.
5. H. Chafi, Z. DeVito, A. Moors, T. Rompf, A. Sujeeth, P. Hanrahan, M. Odersky, and K. Olukotun. Language Virtualization for Heterogeneous Parallel Computing. In Onward!, 2010.
6. C. Click. Global code motion/global value mumbering. In PLDI, pages 246-257, 1995.
7. C. Click and M. Paleczny. A simple graph-based intermediate representation. In Intermediate Representations Workshop, pages 35-49, 1995.
8. A. Cohen, S. Donadio, M. J. Garzarán, C. A. Herrmann, O. Kiselyov, and D. A. Padua. In search of a program generator to implement generic transformations for high-performance computing. Sci. Cornput. Program., 62(1):25-46, 2006.
9. K. Czarnecki, J. T. O'Donnell, J. Striegnitz, and W. Taha. Dsl implementation in metaocaml, template haskell, and c++. In Lengauer et al. [28], pages 51-72.
10. O. Danvy and A. Filinski. Abstracting control. In LISP and Functional Programming, pages 151-160, 1990.
11. O. Danvy and A. Filinski. Representing control: A study of the cps transformation. Mathematical Structures in Computer Science, 2(4): 361-391, 1992.
12. J. L. Eckhardt, R. Kaiabachev, K. N. Swadi, W. Taha, and O. Kiselyov. Practical aspects of multi-stage programming. Technical Report TR05-451, Rice University, 2004.
13. C. Elliott, S. Finne, and O. de Moor. Compiling embedded languages. J. Funct. Program., 13(3):455-481, 2003.
14. B. Emir, M. Odersky, and J. Williams. Matching objects with patterns. In E. Ernst, editor, ECOOP, volume 4609 of Lecture Notes in Computer Science, pages 273-298. Springer, 2007.
15. A. Filinski. Representing monads. In POPL, pages 446-457, 1994.
16. A. Filinski. Monads in action. In M. V. Hermenegildo and J. Palsberg, editors, POPL, pages 483-494. ACM, 2010.
17. C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen. The essence of compiling with continuations. In PLDI, pages 237-247, 1993.
18. M. Frigo. A fast fourier transform compiler. In PLDI, pages 169-180, 1999.
19. M. Guerrero, E. Pizzi, R. Rosenbaum, K. N. Swadi, and W. Taha. Implementing dsls in metaocaml. In J. M. Vlissides and D. C. Schmidt, editors, OOPSLA Companion, pages 41-42. ACM, 2004.
20. C. Hofer, K. Ostermann, T. Rendel, and A. Moors. Polymorphic embedding of dsls. In Y. Smaragdakis and J. G. Siek, editors, GPCE, pages 137-148. ACM, 2008.
21. P. Hudak. Modular domain specific languages and tools. In Proceedings of Fifth International Conference on Software Reuse, pages 134-142, June 1998.
22. U. Jørring and W. L. Scherlis. Compilers and staging transformations. In POPL, pages 86-96, 1986.
23. Y Kameyama, O. Kiselyov, and C. chieh Shan. Closing the stage: from staged code to typed closures. In R. Glück and O. de Moor, editors, PEPM, pages 147-157. ACM, 2008.
24. Y Kameyama, O. Kiselyov, and C. chieh Shan. Shifting the stage: staging with delimited control. In G. Puebla and G. Vidal, editors, PEPM, pages 111-120. ACM, 2009.
25. K. Kennedy, B. Broom, K. D. Cooper, J. Dongarra, R. J. Fowler, D. Gannon, S. L. Johnsson, J. M. Mellor-Crummey, and L. Torczon. Telescoping languages: A strategy for automatic generation of scientific problem-solving systems from annotated libraries. J. Parallel Distrib. Comput., 61(12):1803-1826, 2001.
26. O. Kiselyov, K. N. Swadi, and W. Taha. A methodology for generating verified combinatorial circuits. In G. C. Buttazzo, editor, EMSOFT, pages 249-258. ACM, 2004.
27. D. Leijen and E. Meijer. Domain specific embedded compilers. In DSL, pages 109-122, 1999.
28. C. Lengauer, D. S. Batory, C. Consel, and M. Odersky, editors. Domain-Specific Program Generation, International Seminar, Dagstuhl Castle, Germany, March 23-28, 2003, Revised Papers, volume 3016 of Lecture Notes in Computer Science, 2004. Springer.
29. A. Moors, F. Piessens, and M. Odersky. Generics of a higher kind. In G. E. Harris, editor, OOPSLA, pages 423-438. ACM, 2008.
30. M. Odersky and M. Zenger. Scalable component abstractions. In R. E. Johnson and R. P. Gabriel, editors, OOPSLA, pages 41-57. ACM, 2005.
31. F. Pfenning and C. Elliott. Higher-order abstract syntax. In PLDI, pages 199-208, 1988.
32. M. PUschel, J. M. F Moura, B. Singer, J. Xiong, J. Johnson, D. A. Padua, M. M. Veloso, and R. W. Johnson. Spiral: A generator for platform-adapted libraries of signal processing alogorithms. IJHPCA, 18(1):21-45, 2004.
33. J. C. Reynolds. Definitional interpreters for higher-order programming languages. In ACM '72: Proceedings of the ACM annual conference, pages 717-740, 1972.
34. T. Sheard and S. L. P. Jones. Template meta-programming for haskell. SIGPLAN Notices, 37(12):60-75, 2002.
35. T. Sheard, Z.-E.-A. Benaissa, and E. Pasalic. Dsl implementation using staging and monads. In DSL, pages 81-94, 1999.
36. K. N. Swadi, W. Taha, O. Kiselyov, and E. Pasalic. A monadic approach for avoiding code duplication when staging memoized functions. In J. Hatcliff and F. Tip, editors, PEPM, pages 160-169. ACM, 2006.
37. W. Taha. A sound reduction semantics for untyped cbn multi-stage computation, or, the theory of metaml is non-trivial (extended abstract). In PEPM, pages 34-43, 2000.
38. W. Taha and T. Sheard. Metaml and multi-stage programming with explicit annotations. Theor. Comput. Sci., 248(1-2):211-242, 2000.
39. D. Vandevoorde and N. M. Josuttis. C++ Templates: The Complete Guide. Addison-Wesley, 2002.
40. T. Veldhuizen. Expression templates, C++ gems, 1996.
41. T. L. Veldhuizen. Arrays in blitz++. In D. Caromel, R. R. Oldehoeft, and M. Tholburn, editors, ISCOPE, volume 1505 of Lecture Notes in Computer Science, pages 223-230. Springer, 1998.
42. T. L. Veldhuizen. Active Libraries and Universal Languages. PhD thesis, Indiana University Computer Science, May 2004.
43. P. Wadler. The expression problem. Posted on the Java Genericity mailing list, 1998.
44. E. Westbrook, M. Ricken, J. Inoue, Y Yao, T. Abdelatif, and W. Taha. Mint: Java multi-stage programming using weak separability. In PLDI, 2010.
45. R. C. Whaley, A. Petitet, and J. Dongarra. Automated empirical optimizations of software and the atlas project. Parallel Computing, 27(1-2):3-35, 2001.