The DOI matches its Crossref record.
Building program optimizers with rewriting strategies
Open accessAbstract
We describe a language for defining term rewriting strategies, and its application to the production of program optimizers. Valid transformations on program terms can be described by a set of rewrite rules; rewriting strategies are used to describe when and how the various rules should be applied in order to obtain the desired optimization effects. Separating rules from strategies in this fashion makes it easier to reason about the behavior of the optimizer as a whole, compared to traditional monolithic optimizer implementations. We illustrate the expressiveness of our language by using it to describe a simple optimizer for an ML-like intermediate representation.The basic strategy language uses operators such as sequential composition, choice, and recursion to build transformers from a set of labeled unconditional rewrite rules. We also define an extended language in which the side-conditions and contextual rules that arise in realistic optimizer specifications can themselves be expressed as strategy-driven rewrites. We show that the features of the basic and extended languages can be expressed by breaking down the rewrite rules into their primitive building blocks, namely matching and building terms in variable binding environments. This gives us a low-level core language which has a clear semantics, can be implemented straightforwardly and can itself be optimized. The current implementation generates C code from a strategy specification.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
The spoofax language workbench: rules for declarative specification of languages and IDEs
Kats, L. C. L., & Visser, E. (2010) · Proceedings of the ACM international conference on Object oriented programming systems languages and applications · doi:10.1145/1869459.1869497 · Cited by 402
Self-citationThe TXL source transformation language
Cordy, J. R. (2006) · Science of Computer Programming · doi:10.1016/j.scico.2006.04.002 · Cited by 358
Scrap your boilerplate: a practical design pattern for generic programming
Lämmel, R., & Jones, S. P. (2003) · Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation · doi:10.1145/604174.604179 · Cited by 351
The Asf+Sdf Meta-environment: A Component-Based Language Development Environment
van den Brand, M. G. J., van Deursen, A., Heering, J., de Jong, H. A., de Jonge, M., Kuipers, T., Klint, P., Moonen, L., Olivier, P. A., Scheerder, J., et al. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45306-7_26 · Cited by 323
Self-citationA sound and optimal incremental build system with dynamic dependencies
Erdweg, S., Lichter, M., & Weiel, M. (2015) · Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications · doi:10.1145/2814270.2814316 · Cited by 32
Metadata
- Authors
- Visser, E., Benaissa, Z.-E.-A., & Tolmach, A.
- Venue
- Proceedings of the third ACM SIGPLAN international conference on Functional programming
- Publisher
- ACM
- Published
- 1998-09-29
- Pages
- 13-26
- OpenAlex
- W1978948468
- Cited by
- 251
- References
- 0
- FWCI
- 8.90
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Building program optimizers with rewriting strategies. https://app.cochat.ai/papers/10.1145/289423.289425
- The paper
- Visser, E., Benaissa, Z.-E.-A., & Tolmach, A. (1998). Building program optimizers with rewriting strategies. Proceedings of the third ACM SIGPLAN international conference on Functional programming. https://doi.org/10.1145/289423.289425
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.