The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Lightweight modular staging: a pragmatic approach to runtime code generation and compiled DSLs
Abstract
Software engineering demands generality and abstraction, performance demands specialization and concretization. Generative programming can provide both, but the effort required to develop high-quality program generators likely offsets their benefits, even if a multi-stage programming language is used.We present lightweight modular staging, a library-based multi-stage programming approach that breaks with the tradition of syntactic quasi-quotation and instead uses only types to distinguish between binding times. Through extensive use of component technology, lightweight modular staging makes an optimizing compiler framework available at the library level, allowing programmers to tightly integrate domain-specific abstractions and optimizations into the generation process.We argue that lightweight modular staging enables a form of language virtualization, i.e. allows to go from a pure-library embedded language to one that is practically equivalent to a stand-alone implementation with only modest effort.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Automated empirical optimizations of software and the ATLAS project
Clint Whaley, R., Petitet, A., & Dongarra, J. J. (2001) · Parallel Computing · doi:10.1016/s0167-8191(00)00087-9 · Cited by 1,317
Definitional interpreters for higher-order programming languages
Reynolds, J. C. (1972) · Proceedings of the ACM annual conference on - ACM '72 · doi:10.1145/800194.805852 · Cited by 669
Pfenning, F., & Elliott, C. (1988) · ACM SIGPLAN Notices · doi:10.1145/960116.54010 · Cited by 581
Template meta-programming for Haskell
Sheard, T., & Jones, S. P. (2002) · Proceedings of the 2002 ACM SIGPLAN workshop on Haskell · doi:10.1145/581690.581691 · Cited by 545
The essence of compiling with continuations
Flanagan, C., Sabry, A., Duba, B. F., & Felleisen, M. (1993) · Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation · doi:10.1145/155090.155113 · Cited by 534
Building domain-specific embedded languages
Hudak, P. (1996) · ACM Computing Surveys · doi:10.1145/242224.242477 · Cited by 477
A fast Fourier transform compiler
Frigo, M. (1999) · Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation · doi:10.1145/301618.301661 · Cited by 438
Danvy, O., & Filinski, A. (1990) · Proceedings of the 1990 ACM conference on LISP and functional programming · doi:10.1145/91556.91622 · Cited by 403
MetaML and multi-stage programming with explicit annotations
Taha, W., & Sheard, T. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(00)00053-0 · Cited by 383
Veldhuizen, T. L. (1996) · Cited by 366
Representing Control: a Study of the CPS Transformation
Danvy, O., & Filinski, A. (1992) · Mathematical Structures in Computer Science · doi:10.1017/s0960129500001535 · Cited by 352
Multi-stage programming with explicit annotations
Taha, W., & Sheard, T. (1997) · Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation · doi:10.1145/258993.259019 · Cited by 342
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
CARETTE, J., KISELYOV, O., & SHAN, C.-C. (2009) · Journal of Functional Programming · doi:10.1017/s0956796809007205 · Cited by 279
C++ Templates: The Complete Guide
Josuttis, N. M., Gregor, D., & Vandevoorde, D. (2002) · Medical Entomology and Zoology · Cited by 253
Domain specific embedded compilers
Leijen, D., & Meijer, E. (1999) · Proceedings of the 2nd conference on Domain-specific languages · doi:10.1145/331960.331977 · Cited by 249
Filinski, A. (1994) · Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94 · doi:10.1145/174675.178047 · Cited by 248
Veldhuizen, T. L. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49372-7_24 · Cited by 203
Danvy, O., & Nielsen, L. R. (2001) · Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming · doi:10.1145/773184.773202 · Cited by 189
Spiral: A Generator for Platform-Adapted Libraries of Signal Processing Alogorithms
Püschel, M., Moura, J. M. F., Singer, B., Xiong, J., Johnson, J., Padua, D., Veloso, M., & Johnson, R. W. (2004) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342004041291 · Cited by 180
Compilers and staging transformations
Jorring, U., & Scherlis, W. L. (1986) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/512644.512652 · Cited by 151
C and tcc: a language and compiler for dynamic code generation
Poletto, M., Hsieh, W. C.-Y., Engler, D., & Kaashoek, M. F. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/316686.316697 · Cited by 138
Global code motion/global value numbering
Click, C. (1995) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/207110.207154 · Cited by 109
Language virtualization for heterogeneous parallel computing
Chafi, H., DeVito, Z., Moors, A., Rompf, T., Sujeeth, A. K., Hanrahan, P., Odersky, M., & Olukotun, K. (2010) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/1869459.1869527 · Cited by 96
Self-citationImplementing Domain-Specific Languages for Heterogeneous Parallel Computing
Lee, H., Brown, K. J., Sujeeth, A. K., Chafi, H., Rompf, T., Odersky, M., & Olukotun, K. (2011) · IEEE Micro · doi:10.1109/mm.2011.68 · Cited by 88
Self-citationBuilding-Blocks for Performance Oriented DSLs
Rompf, T., Sujeeth, A. K., Lee, H., Brown, K. J., Chafi, H., Odersky, M., & Olukotun, K. (2011) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.66.5 · Cited by 60
Self-citationA methodology for generating verified combinatorial circuits
Kiselyov, O., Swadi, K. N., & Taha, W. (2004) · ACM International Conference on Embedded Software (EMSOFT) · doi:10.1145/1017753.1017794 · Cited by 57
In search of a program generator to implement generic transformations for high-performance computing
Cohen, A., Donadio, S., Garzarán, M. J., Herrmann, C. A., Kiselyov, O., & Padua, D. (2006) · Science of Computer Programming · doi:10.1016/j.scico.2005.10.013 · Cited by 53
Filinski, A. (2010) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1706299.1706354 · Cited by 47
Runtime Code Generation in C++ as a Foundation for Domain-Specific Optimisation
Beckmann, O., Houghton, A., Mellor, M. R., & Kelly, P. H. J. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25935-0_17 · Cited by 45
Shifting the stage: staging with delimited control
Kameyama, Y., Kiselyov, O., & Shan, C.-C. (2009) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/1480945.1480962 · Cited by 44
Multi-stage Programming with Functors and Monads: Eliminating Abstraction Overhead from Generic Code
Carette, J., & Kiselyov, O. (2005) · Lecture notes in computer science · doi:10.1007/11561347_18 · Cited by 34
Active libraries and universal languages
Lumsdaine, A., & Veldhuizen, T. L. (2004) · Cited by 29
Gaussian Elimination: A case study in efficient genericity with MetaOCaml
Carette, J. (2006) · Science of Computer Programming · doi:10.1016/j.scico.2005.10.012 · Cited by 27
Cited by
Programming With Models: Writing Statistical Algorithms for General Model Structures With NIMBLE
de Valpine, P., Turek, D., Paciorek, C. J., Anderson-Bergman, C., Lang, D. T., & Bodik, R. (2017) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2016.1172487 · Cited by 998
Demystifying differentiable programming: shift/reset the penultimate backpropagator
Wang, F., Zheng, D., Decker, J., Wu, X., Essertel, G. M., & Rompf, T. (2019) · Proceedings of the ACM on Programming Languages · doi:10.1145/3341700 · Cited by 59
Self-citation
Metadata
- Authors
- Rompf, T., & Odersky, M.
- Venue
- Proceedings of the ninth international conference on Generative programming and component engineering
- Publisher
- ACM
- Published
- 2010-10-10
- Pages
- 127-136
- OpenAlex
- W2154697693
- Cited by
- 277
- References
- 34
- FWCI
- 14.03
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.