A Look Inside GHC's Optimiser
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:
- Haskell eXchange 2019 (in London on 10th - 11th October 2019)
- A new foundation for refactoring - ghc-exactprint (SkillsCast recorded in October 2015)
- Introduction to Docker Fundamentals (in London on 30th September - 1st October 2019)
- CloudNative London 2019 (in London on 25th - 27th September 2019)
- Keynote Evening by Brian Ketelsen! (in London on 17th October 2019)
- Fast Track to F# with Tomas Petricek (in London on 4th - 5th November 2019)
- Lightbend Akka for Scala - Professional (in London on 11th - 12th November 2019)
- Clojure eXchange 2019 (in London on 2nd - 3rd December 2019)
- F#unctional Londoners September (in London on 18th September 2019)
- Scala 2.13 and Beyond! (SkillsCast recorded in April 2019)
- Introduction to Markov Chains in F# (SkillsCast recorded in April 2019)
Thanks to our sponsors
A Look Inside GHC's Optimiser
Matthew Pickering
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.
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:
- Haskell eXchange 2019 (in London on 10th - 11th October 2019)
- A new foundation for refactoring - ghc-exactprint (SkillsCast recorded in October 2015)
- Introduction to Docker Fundamentals (in London on 30th September - 1st October 2019)
- CloudNative London 2019 (in London on 25th - 27th September 2019)
- Keynote Evening by Brian Ketelsen! (in London on 17th October 2019)
- Fast Track to F# with Tomas Petricek (in London on 4th - 5th November 2019)
- Lightbend Akka for Scala - Professional (in London on 11th - 12th November 2019)
- Clojure eXchange 2019 (in London on 2nd - 3rd December 2019)
- F#unctional Londoners September (in London on 18th September 2019)
- Scala 2.13 and Beyond! (SkillsCast recorded in April 2019)
- Introduction to Markov Chains in F# (SkillsCast recorded in April 2019)
Thanks to our sponsors
A Look Inside GHC's Optimiser
Matthew Pickering
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.