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.

Type

Conference paper

Intellectual base

Primary research

Year

2001

Link

https://www.microsoft.com/en-us/research/publication/playing-by-the-rules-rewriting-as-a-practical-optimisation-technique-in-ghc/

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 -> b is lifted to operate inside List, Maybe, Tree, or IO without unwrapping, and the two laws guarantee that lifting a composed function equals composing the lifts — so refactoring fmap g . fmap h into fmap (g . h) is provably safe and is a standard compiler and programmer optimization

    This 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.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:1ef3a9d641c8 · see in the full table