Gaussian Elimination: A case study in efficient genericity with MetaOCaml

Science of Computer Programming

Volumn 62, Issue 1, 2006, Pages 3-24

  Carette, Jacques ^a  

^a MCMASTER UNIVERSITY   (Canada)

Author keywords

Generative; Genericity; Linear algebra; MetaOCaml; Staging

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); LINEAR ALGEBRA; PARAMETER ESTIMATION; STRUCTURAL DESIGN;

GENERATIVE; GENERICITY; METAOCAML; STAGING;

WHITE NOISE;

EID: 33745666820     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2005.10.012     Document Type: Article

References (53)

1. Gruntz D., and Monagan M. Introduction to Gauss. SIGSAM Bulletin: Communications on Computer Algebra 28 2 (1994) 3-19
2. Jones N., Gomard C., and Sestoft P. Partial Evaluation and Automatic Program Generation (1993), Prentice-Hall
3. Abelson H., Dybvig R.K., Haynes C.T., Rozas G.J., Adams IV N.I., Friedman D.P., Kohlbecker E., Steele Jr. G.L., Bartley D.H., Halstead R., Oxley D., Sussman G.J., Brooks G., Hanson C., Pitman K.M., and Wand M. Revised report on the algorithmic language Scheme. Higher-Order and Symbolic Computation 11 1 (1998) 7-105. http://www.wkap.nl/oasis.htm/168705 URL:
4. Czarnecki K., O'Donnell J.T., Striegnitz J., and Taha W. DSL implementation in MetaOCaml, Template Haskell, and C++. In: Lengauer C., Batory D.S., Consel C., and Odersky M. (Eds). Domain-Specific Program Generation. Lecture Notes in Computer Science vol. 3016 (2003), Springer 51-72
5. Parnas D.L. On the design and development of program families. IEEE Transactions on Software Engineering 2 1 (1976) 1-9
6. Parnas D.L. On the criteria to be used in decomposing systems into modules. Communication of the ACM 15 12 (1972) 1053-1058
7. E.W. Dijkstra, On the role of scientific thought, published as [8], August 1974. URL: http://www.cs.utexas.edu/users/EWD/ewd04xx/EWD447.PDF
8. Dijkstra E.W. On the role of scientific thought. Selected Writings on Computing: A Personal Perspective (1982), Springer-Verlag 60-66
9. Wirth N. Program development by stepwise refinement. Communications of the ACM 14 4 (1971) 221-227
10. Musser D.R., and Stepanov A.A. Generic programming. ISSAC 1988: Proceedings of the International Symposium on Symbolic and Algebraic Computation. Lecture Notes in Computer Science vol. 358 (1989), Springer-Verlag 13-25. http://citeseer.lcs.mit.edu/musser88generic.html URL:
11. Musser D.R., and Stepanov A.A. Algorithm-oriented generic libraries. Software - Practice and Experience 24 7 (1994) 623-642
12. In: Backhouse R.C., and Gibbons J. (Eds). Generic Programming - Advanced Lectures. Lecture Notes in Computer Science vol. 2793 (2003), Springer
13. Jay C.B. A semantics for shape. Science of Computer Programming 25 2-3 (1995) 251-283
14. R. Lämmel, Typed generic traversal with term rewriting strategies, Journal of Logic and Algebraic Programming 54. Also available as arXiv technical report cs.PL/0205018
15. Czarnecki K., and Eisenecker U.W. Generative programming: methods, tools, and applications (2000), ACM Press/Addison-Wesley Publishing Co.
16. Myers P.G. SPOM: a regional model of the sub-polar North Atlantic. Atmosphere-Ocean 40 4 (2002) 445-463
17. Veldhuizen T.L. Arrays in Blitz++. Proceedings of the 2nd International Scientific Computing in Object-Oriented Parallel Environments. ISCOPE'98. Lecture Notes in Computer Science (1998), Springer-Verlag
18. Veldhuizen T.L., and Gannon D. Active Libraries: Rethinking the roles of compilers and libraries. Proceedings of the SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing. OO'98 (1998), SIAM Press
19. John I., Reynders V.W., and Cummings J.C. The POOMA framework. Computers in Physics 12 5 (1998) 453-459
20. Li X.S., Demmel J.W., Bailey D.H., Henry G., Hida Y., Iskandar J., Kahan W., Kang S.Y., Kapur A., Martin M.C., Thompson B.J., Tung T., and Yoo D.J. Design, implementation and testing of extended and mixed precision BLAS. ACM Transactions on Mathematical Software 28 2 (2002) 152-205. http://www.nersc.gov/~xiaoye/XBLAS
21. Whaley R.C., Petitet A., and Dongarra J.J. Automated empirical optimization of software and the ATLAS project. Parallel Computing 27 1-2 (2001) 3-35. http://www.netlib.org/lapack/lawns/lawn147.ps Also available as University of Tennessee LAPACK Working Note #147, UT-CS-00-448, 2000 (www.netlib.org/lapack/lawns/lawn147.ps)
22. Butler G., Czarnecki K., Batory D., and Eisenecker U. Generative techniques for product lines. ICSE '01: Proceedings of the 23rd International Conference on Software Engineering (2001), IEEE Computer Society 760-761
23. Garcia R., Jarvi J., Lumsdaine A., Siek J., and Willcock J. A comparative study of language support for generic programming. OOPSLA '03: Proceedings of the 18th Annual ACM SIGPLAN Conference on Object-Oriented Programing, Systems, Languages, and Applications (2003), ACM Press, New York, NY, USA 115-134
24. Le Meur A.-F., Lawall J., and Consel C. Specialization scenarios: A pragmatic approach to declaring program specialization. Higher-Order and Symbolic Computation 17 1 (2004) 47-92
25. Marlet R., Thibault S., and Consel C. Efficient implementations of software architectures via partial evaluation. Journal of Automated Software Engineering 6 4 (1999) 411-440
26. Cousot P., and Cousot R. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. POPL (1977) 238-252
27. Full MetaOCaml code and examples, http://www.metaocaml.org/examples/gausselim
28. Burden R.L., and Faires J.D. Numerical Analysis. 4th ed. (1989), PWS Publishing Co.
29. Geddes K.O., Czapor S.R., and Labahn G. Algorithms for Computer Algebra (1992), Kluwer Academic Publishers Group, Norwell, MA, USA, Dordrecht, The Netherlands
30. Monagan M.B., Geddes K.O., Heal K.M., Labahn G., Vorkoetter S.M., McCarron J., and DeMarco P. Maple 7 Programming Guide (2001), Waterloo Maple Inc.
31. Jenks R.D., and Sutor R.S. AXIOM: The Scientific Computation System (1992), Springer Verlag
32. Watt S.M. Aldor. In: Grabmeier J., Kaltofen E., and Weispfennig V. (Eds). Computer Algebra Handbook: Foundations, Applications, Systems (2003), Springer Verlag
33. W. Taha, Multi-stage programming: Its theory and applications, Ph.D. Thesis, Oregon Graduate Institute of Science and Technology, 1999
34. O. Kiselyov, K.N. Swadi, W. Taha, A methodology for generating verified combinatorial circuits, in: ACM International Conference on Embedded Software, EMSOFT, 2004
35. Hutton G., and Meijer E. Monadic parser combinators. Journal of Functional Programming 8 4 (1996) 437-444
36. Stoy J.E. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory (1981), MIT Press
37. Sumii E., and Kobayashi N. A hybrid approach to online and offline partial evaluation. Higher-Order and Symbolic Computation 14 2-3 (2001) 101-142. http://citeseer.ist.psu.edu/article/sumii00hybrid.html URL:
38. Abelson H., Sussman G.J., and Sussman J. Structure and Interpretation of Computer Programs (1996), MIT Press, Cambridge, MA
39. Reynolds J.C. Definitional interpreters for higher-order programming languages. ACM '72: Proceedings of the ACM Annual Conference (1972), ACM Press 717-740
40. Xi H., Chen C., and Chen G. Guarded recursive datatype constructors. POPL '03: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2003), ACM Press, New York, NY, USA 224-235
41. S.P. Jones, G. Washburn, S. Weirich, Wobbly types: Type inference for generalised algebraic data types, July 2004
42. V. Simonet, F. Pottier, Constraint-based type inference for guarded algebraic data types, Research Report 5462, INRIA, January 2005
43. Leijen D., and Meijer E. Domain specific embedded compilers. PLAN '99: Proceedings of the 2nd Conference on Domain-Specific Languages (1999), ACM Press, New York, NY, USA 109-122
44. Calcagno C., Taha W., Huang L., and Leroy X. Implementing multi-stage languages using asts, gensym, and reflection. GPCE '03: Proceedings of the Second International Conference on Generative Programming and Component Engineering (2003), Springer-Verlag, New York, Inc., New York, NY, USA 57-76
45. Frigo M., and Johnson S.G. FFTW: An adaptive software architecture for the FFT. Proc. 1998 IEEE Intl. Conf. Acoustics Speech and Signal Processing vol. 3 (1998), IEEE 1381-1384
46. J. Davenport, P. Gianni, R. Jenks, V. Miller, S. Morrison, M. Rothstein, C. Sundaresan, R. Sutor, B. Trager, Scratchpad, Mathematical Sciences Department, IBM Thomas Watson Research Center, 1984
47. de Bruijn N.G. AUTOMATH, a language for mathematics. In: Siekmann J., and Wrightson G. (Eds). Automation of Reasoning 2: Classical Papers on Computational Logic 1967-1970 (1983), Springer, Berlin, Heidelberg 159-200
48. Le Meur A.-F., and Consel C. Generic software component configuration via partial evaluation. SPLC'2000 Workshop - Product Line Architecture (2000), Denver, Colorado
49. Jones M.P. Dictionary-free overloading by partial evaluation. Lisp and Symbolic Computation 8 3 (1995) 229-248
50. Augustsson L. Implementing Haskell overloading. FPCA '93: Proceedings of the Conference on Functional Programming Languages and Computer Architecture (1993), ACM Press, New York, NY, USA 65-73
51. Bondorf A., and Dussart D. Improving CPS-based partial evaluation: Writing cogen by hand. PEPM (1994) 1-9
52. Thiemann P. Cogen in six lines. ICFP (1996) 180-189
53. Carette J., and Kiselyov O. Multi-stage programming with Functors and Monads: Eliminating abstraction overhead from generic code. Generative Programming and Component-based Engineering GPCE (2005)