Building program optimizers with rewriting strategies

DOI10.1145/289423.289425zbMath1369.68084OpenAlexW1978948468MaRDI QIDQ5348884

Andrew Tolmach, Zine-El-Abidine Benaissa, Eelco Visser

Publication date: 21 August 2017

Published in: Proceedings of the third ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/289423.289425

Mathematics Subject Classification ID

Theory of programming languages (68N15) Grammars and rewriting systems (68Q42)

Related Items (19)

Semi-automatic grammar recovery ⋮ Unnamed Item ⋮ Static consistency checking of web applications with WebDSL ⋮ Typed generic traversal with term rewriting strategies ⋮ Specifying rewrite strategies for interactive exercises ⋮ A survey of strategies in rule-based program transformation systems ⋮ A higher-order strategy for eliminating common subexpressions ⋮ Unnamed Item ⋮ Recognizing Strategies ⋮ Strategy-Based Proof Calculus for Membrane Systems ⋮ Adaptable Traces for Program Explanations ⋮ Interleaving Strategies ⋮ Maximally Parallel Contextual String Rewriting ⋮ Generic type-preserving traversal strategies ⋮ A Survey of Rewriting Strategies in Program Transformation Systems ⋮ Fusing Logic and Control with Local Transformations ⋮ A Logic for Rewriting Strategies ⋮ Scoped Dynamic Rewrite Rules ⋮ Regular Strategies as Proof Tactics for CIRC

This page was built for publication: Building program optimizers with rewriting strategies