The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Multi-stage programming with explicit annotations
Abstract
We introduce MetaML, a statically-typed multi-stage programming language extending Nielson and Nielson's two stage notation to an arbitrary number of stages. MetaML extends previous work by introducing four distinct staging annotations which generalize those published previously [25, 12, 7, 6]We give a static semantics in which type checking is done once and for all before the first stage, and a dynamic semantics which introduces a new concept of cross-stage persistence, which requires that variables available in any stage are also available in all future stages.We illustrate that staging is a manual form of binding time analysis. We explain why, even in the presence of automatic binding time analysis, explicit annotations are useful, especially for programs with more than two stages.A thesis of this paper is that multi-stage languages are useful as programming languages in their own right, and should support features that make it possible for programmers to write staged computations without significantly changing their normal programming style. To illustrate this we provide a simple three stage example, and an extended two-stage example elaborating a number of practical issues.
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
A theory of type polymorphism in programming
Milner, R. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90014-4 · Cited by 2,205
Partial evaluation and automatic program generation
Jones, N. D., Gomard, C. K., & Sestoft, P. (1993) · Medical Entomology and Zoology · Cited by 1,440
Call-by-name, call-by-value and the λ-calculus
Plotkin, G. D. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90017-1 · Cited by 1,154
A Syntactic Approach to Type Soundness
Wright, A. K., & Felleisen, M. (1994) · Information and Computation · doi:10.1006/inco.1994.1093 · Cited by 1,136
Tutorial notes on partial evaluation
Consel, C., & Danvy, O. (1993) · Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93 · doi:10.1145/158511.158707 · Cited by 316
Type-directed partial evaluation
Danvy, O. (1996) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/237721.237784 · Cited by 170
A modal analysis of staged computation
Davies, R., & Pfenning, F. (1996) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/237721.237788 · Cited by 143
A software engineering experiment in software component generation
Kieburtz, R. B., McKinney, L., Bell, J., Hook, J., Kotov, A., Lewis, J. R., Oliva, D. P., Sheard, T., Smith, I., & Walton, L. A. (1996) · doi:10.5555/227726.227842 · Cited by 139
Self-citationComputing with rewrite systems
Dershowitz, N. (1985) · Information and Control · doi:10.1016/s0019-9958(85)80003-6 · Cited by 109
Efficient multi-level generating extensions for program specialization
Glück, R., & Jørgensen, J. (1995) · Lecture notes in computer science · doi:10.1007/bfb0026825 · Cited by 103
Monadic state: axiomatization and type safety
Launchbury, J., & Sabry, A. (1997) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/258948.258970 · Cited by 38
Jones, N. D. (1995) · ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM) · doi:10.1145/215465.215468 · Cited by 24
Reasoning about hierarchies of online program specialization systems
Hatcliff, J., & Glück, R. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61580-6_9 · Cited by 7
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
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
Self-citationThe essence of command injection attacks in web applications
Su, Z., & Wassermann, G. (2006) · Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1111037.1111070 · Cited by 515
A modal analysis of staged computation
Davies, R., & Pfenning, F. (2001) · Journal of the ACM · doi:10.1145/382780.382785 · Cited by 293
Lightweight modular staging: a pragmatic approach to runtime code generation and compiled DSLs
Rompf, T., & Odersky, M. (2010) · Proceedings of the ninth international conference on Generative programming and component engineering · doi:10.1145/1868294.1868314 · Cited by 277
Metadata
- Authors
- Taha, W., & Sheard, T.
- Venue
- Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
- Publisher
- ACM
- Published
- 1997-12
- Pages
- 203-217
- OpenAlex
- W2096314727
- Cited by
- 342
- References
- 14
- FWCI
- 14.67
- 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.