Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code

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

Volumn 3676 LNCS, Issue , 2005, Pages 256-274

  Carette, Jacques ^a   Kiselyov, Oleg ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b FNMOC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GAUSSIAN ELIMINATION; MULTI-STAGE PROGRAMMING; OCAML'S ADVANCED MODULE SYSTEM;

ABSTRACTING; ALGORITHMS; CODES (SYMBOLS); KNOWLEDGE ACQUISITION; MATRIX ALGEBRA; PROGRAM COMPILERS;

COMPUTER PROGRAMMING;

EID: 33646133205     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11561347_18     Document Type: Conference Paper

References (36)

1. Anders Bondorf. Improving binding times without explicit CPS-conversion. In 1992 ACM Conference on Lisp and Functional Programming. San Francisco, California, pages 1-10, 1992.
2. Cristiano Calcagno, Walid Taha, Liwen Huang, and Xavier Leroy. Implementing multi-stage languages using asts, gensym, and reflection. In Krzysztof Czarnecki, Prank Pfenning, and Yannis Smaragdakis, editors, Generative Programming and Component Engineering (GPCE), LNCS. Springer-Verlag, 2003.
3. Jacques Carette. Gaussian Elimination: a case study in efficient genericity with MetaOCaml, 2005. submitted.
4. Zizhong Chen, Jack Dongarra, Piotr Luszczek, and Kenneth Rothe. Lapack for clusters project: An example of self adapting numerical software. Hawaii International Conference on System Sciences HICSS-37, 2004.
5. Source code, http://www.cas.mcmaster.ca/~carette/rnetamonads/.
6. Albert Cohen, Sebastien Donadio, Mari'a Jesu's Garzara'n, Cristoph Herrmann, and David Padua. In search for a program generator to implement generic transformations for high-performance computing. MetaOCaml Workshop, October 2004.
7. Krzysztof Czarnecki and Ulrich W. Eisenecker. Generative programming: methods, tools, and applications. ACM Press/Addison-Wesley Publishing Co., 2000.
8. Krzysztof Czarnecki, John T. O'Donnell, Jörg Striegnitz, and Walid Taha. DSL implementation in MetaOCaml, Template Haskell, and C++. In Christian Lengauer, Don S. Batory, Charles Consel, and Martin Odersky, editors, Domain-Specific Program Generation, volume 3016 of Lecture Notes in Computer Science, pages 51-72. Springer, 2003.
9. Daniel de Rauglaudre. Camlp4 reference manual. http://caml.inria.fr/ camlp4/manual/, Jan. 2002.
10. Edsger W. Dijkstra. On the role of scientific thought, published as [11].
11. Edsger W. Dijkstra. On the role of scientific thought. In Selected Writings on Computing: A Personal Perspective, pages 60-66. Springer-Verlag, 1982.
12. Jason L. Eckhardt, Roumen Kaiabachev, Kedar N. Swadi, Walid Taha, and Oleg Kiselyov. Practical aspects of multi-stage programming. Rice University Techical Report TR05-451, http://www.cs.rice.edu/~taha/publications/preprints/ 2004-02-16.pdf, February 2004.
13. Andrzej Filinski. Representing monads. In POPL, pages 446-457, 1994.
14. Robert Glück and Jesper Jørgensen. An automatic program generator for multilevel specialization. Lisp and Symbolic Computation, 10(2): 113-158, 1997.
15. Robert Glück, Ryo Nakashige, and Robert Zöchling. Binding-time analysis applied to mathematical algorithms. In System Modelling and Optimization, 1995.
16. Richard D. Jenks and Robert S. Sutor. AXIOM: The Scientific Computation System. Springer Verlag, 1992.
17. III John V.W. Reynders and Julian C. Cummings. The POOMA framework. Comput. Phys., 12(5):453-459, 1998.
18. Ken Kennedy, Bradley Broom, Keith Cooper, Jack Dongarra, Rob Fowler, Dennis Cannon, Lennart Johnsson, John Mellor-Crummey, and Linda Torczon. Telescoping languages: A strategy for automatic generation of scientific problem-solving systems from annotated libraries. Journal of Parallel and Distributed Computing, 61(12):1803-1826, December 2001.
19. Gregor Kiczales, John Lamping, Anurag Menhdhekar, Chris Maeda, Cristina Lopes, Jean-Marc Loingtier, and John Irwin. Aspect-oriented programming. In Mehmet Aks.it and Satoshi Matsuoka, editors, Proceedings European Conference on Object-Oriented Programming, volume 1241, pages 220-242. Springer-Verlag, Berlin, Heidelberg, and New York, 1997.
20. Oleg Kiselyov, Kedar N. Swadi, and Walid Taha. A methodology for generating verified combinatorial circuits. In EMSOFT '04: Proceedings of the fourth ACM international conference on Embedded software, pages 249-258, New York, NY, USA, 2004. ACM Press.
21. Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen, and Bruce F. Duba. Hygienic macro expansion. In LISP and Functional Programming, pages 151-161, 1986.
22. Sheng Liang, Paul Hudak, and Mark Jones. Monad transformers and modular interpreters. In POPL '95: Conference Record of the Annual ACM Symposium on Principles of Programming Languages, pages 333-343, New York, 1995. ACM Press.
23. MetaOCaml. http://www.metaocaml.org.
24. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(l):55-92, 1991.
25. David R. Musser and Alexander A. Stepanov. Algorithm-oriented generic libraries. Software - Practice and Experience, 24(7):623-642, 1994.
26. David Lorge Parnas. On the criteria to be used in decomposing systems into modules. Commun. ACM, 15(12): 1053-1058, 1972.
27. Simon Peyton Jones et al. The Revised Haskell 98 Report. Cambridge Univ. Press, 2003. Also on http://haskell.org/.
28. Markus Püschel, 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. SPIRAL: Code generation for DSP transforms. Proceedings of the IEEE, special issue on "Program Generation, Optimization, and Adaptation", 93(2), 2005.
29. Jeremy Siek, Lee-Quan Lee, and Andrew Lumsdaine. The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley, 2002.
30. Walid Taha. Multi-Stage Programming: its theory and applications. PhD thesis, Oregon Graduate Institute of Science and Technology, 1999.
31. Walid Taha. A sound reduction semantics for untyped CBN multi-stage computation. Or, the theory of MetaML is non-trival. In PEPM, pages 34-43, 2000.
32. Walid Taha and Tim Sheard. Multi-stage programming with explicit annotations. In Proceedings of the Symposium on Partial Evaluation and Semantic-Based Program Manipulation (PEPM), pages 203-217, Amsterdam, June 1997. ACM Press.
33. Todd L. Veldhuizen. Arrays in Blitz++. In Proceedings of the 2nd International Scientific Computing in Object-Oriented Parallel Environments (ISCOPE'98), Lecture Notes in Computer Science. Springer-Verlag, 1998.
34. Todd L. Veldhuizen. Active Libraries and Universal Languages. PhD thesis, Indiana University Computer Science, May 2004.
35. Stephen M. Watt. Aldor. In J. Grabmeier, E. Kaltofen, and V. Weispfennig, editors, Computer Algebra Handbook: Foundations, Applications, Systems. Springer Verlag, 2003.
36. R. Clint Whaley, Antoine Petitet, and Jack J. Dongarra. Automated empirical optimization of software and the ATLAS project. Parallel Computing, 27(1-2):335, 2001.