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

@inproceedings{citeulike:241453, abstract = {With Gaussian Elimination as a representative family of numerical and symbolic algorithms, we use multi-stage programming, monads and Ocaml's advanced module system to demonstrate the complete elimination of the abstraction overhead while avoiding any inspection of the generated code. We parameterize our Gaussian Elimination code to a great extent (over domain, matrix representations, determinant tracking, pivoting policies, result types, etc) at no run-time cost. Because the resulting code is generated just right and not changed afterwards, we enjoy MetaOCaml's guaranty that the generated code is well-typed. We further demonstrate that various abstraction parameters (aspects) can be made orthogonal and compositional, even in the presence of name-generation for temporaries and other bindings and ``interleaving'' of aspects. We also show how to encode some domain-specific knowledge so that ``clearly wrong'' compositions can be statically rejected by the compiler when processing the generator rather than the generated code.}, author = {Carette, Jacques and Kiselyov, Oleg}, citeulike-article-id = {241453}, citeulike-linkout-0 = {http://www.cas.mcmaster.ca/~carette/metamonads/}, journal = {Generative Programming and Component Engineering}, keywords = {for-matt, monads, multi-stage-languages}, posted-at = {2005-08-20 02:02:51}, priority = {4}, title = {Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code}, url = {http://www.cas.mcmaster.ca/~carette/metamonads/}, year = {2005} }

TY - CONF ID - citeulike:241453 L3 - citeulike-article-id:241453 N2 - With Gaussian Elimination as a representative family of numerical and symbolic algorithms, we use multi-stage programming, monads and Ocaml's advanced module system to demonstrate the complete elimination of the abstraction overhead while avoiding any inspection of the generated code. We parameterize our Gaussian Elimination code to a great extent (over domain, matrix representations, determinant tracking, pivoting policies, result types, etc) at no run-time cost. Because the resulting code is generated just right and not changed afterwards, we enjoy MetaOCaml's guaranty that the generated code is well-typed. We further demonstrate that various abstraction parameters (aspects) can be made orthogonal and compositional, even in the presence of name-generation for temporaries and other bindings and ``interleaving'' of aspects. We also show how to encode some domain-specific knowledge so that ``clearly wrong'' compositions can be statically rejected by the compiler when processing the generator rather than the generated code. JF - Generative Programming and Component Engineering TI - Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code KW - for-matt KW - monads KW - multi-stage-languages AU - Carette, Jacques AU - Kiselyov, Oleg PY - 2005/// UR - http://www.cas.mcmaster.ca/~carette/metamonads/ ER -