A higher-order strategy for eliminating common subexpressions

DOI10.1016/j.cl.2008.06.004zbMath1387.68056OpenAlexW2007692297MaRDI QIDQ1749242

R. Daniel Resler, Victor L. Winter

Publication date: 16 May 2018

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cl.2008.06.004

zbMATH Keywords

rewritingprogram transformationcommon subexpression eliminationdistributed data problemhigher-order strategiesstrategic programming

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Uses Software

• Tom

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus, its syntax and semantics
• Compiler optimization correctness by temporal logic
• A transformation-based optimiser for Haskell
• The transient combinator, higher-order strategies, and the distributed data problem
• The rewriting calculus - part I
• Complete Register Allocation Problems
• Code Generation for a One-Register Machine
• Global optimization by suppression of partial redundancies
• Shrinking lambda expressions in linear time
• Building program optimizers with rewriting strategies

This page was built for publication: A higher-order strategy for eliminating common subexpressions