Playing by the Rules: Rewriting as a practical optimisation technique in GHC¶
Simon, P. J., Andrew, T., & Tony, H. (2001). Playing by the Rules: Rewriting as a practical optimisation technique in GHC: Rewriting as a practical optimisation technique in GHC. Proceedings of the 2001 Haskell Workshop.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Functor
- The payoff is uniform, law-guaranteed reuse: any function
a -> bis lifted to operate insideList,Maybe,Tree, orIOwithout unwrapping, and the two laws guarantee that lifting a composed function equals composing the lifts — so refactoringfmap g . fmap hintofmap (g . h)is provably safe and is a standard compiler and programmer optimizationThis sourceThe GHC rewrite-rules paper, in which map f (map g xs) = map (f. g) xs appears as a compiler rewrite rule, establishing the 'standard compiler optimisation' half; the paper notes GHC does not verify such rules, so the proof of safety rests on the functor laws rather than on this source.
Supported in partVerified against the source
- The payoff is uniform, law-guaranteed reuse: any function
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:1ef3a9d641c8 · see in the full table