Please log in to watch this conference skillscast.
The joy of functional programming is writing high-level declarative code. The belief of Haskell programmers is that GHC should compile this code to remove the overhead of abstraction. The reality is that sometimes it does and sometimes it doesn't!
In this talk, you will explore the basic operation of the main optimisations that GHC performs, what users should expect from the compiler and what options they have to control how the optimiser behaves. We will focus on core-to-core passes such as inlining, specialisation, SpecConstr, SAT and so on.
The aim of this talk is to make you think more carefully about how the compiler optimises their code. There will be lots of examples of real world code and toy examples which demonstrate how specific passes work. Ultimately by users better understanding the optimisation pipeline, I hope that library writers experience can feed back into making GHC better optimise modern Haskell code.
YOU MAY ALSO LIKE:
- Gazing into the Void: Understanding Space (Leaks) (SkillsCast recorded in October 2019)
- Lightbend Akka for Scala - Professional (in London on 11th - 12th November 2019)
- Advanced Scala with Dick Wall (in London on 9th - 11th December 2019)
- Clojure eXchange 2019 (in London on 2nd - 3rd December 2019)
- Scala eXchange London 2019 (in London on 12th - 13th December 2019)
- Reprogramming Biology with F# (in London on 28th November 2019)
- Lightning Talk: Making and Testing Code Generators in Haskell (SkillsCast recorded in October 2019)
- GHC Runtime Linker by Example (SkillsCast recorded in October 2019)
A Look Inside GHC's Optimiser
Matthew is a PhD student at the University of Bristol and one of the core GHC contributors. His research interests are in program generation and multi-stage programming.