Higher-Order Type-Level Programming

Please log in to watch this conference skillscast.

Thanks to its myriad of extensions, GHC's type system has come a long way in offering a powerful language for expressing complex programs at the type-level.

However, things could still be improved. Type-level programs are notoriously tricky to write, partly because the type language is first-order, meaning that our old friends like the maps and folds cannot be expressed.

In this talk, Csongor will walk through the type-level programming facilities of modern Haskell, and present a new GHC extension which enables higher-order type programming: UnsaturatedTypeFamilies.

This talk is based on the ICFP 2019 paper Higher-Order Type-Level Programming in Haskell and is aimed at people who are curious about how deep the rabbit hole goes if we do enable every possible language extension under the sun.

YOU MAY ALSO LIKE:

• Generating Elm data types using GHC Generics (SkillsCast recorded in October 2016)
• Haskell eXchange 2021 (Online Conference on 16th - 17th November 2021)
• Theorems for Free (SkillsCast recorded in November 2020)
• Comparing Strict and Lazy (SkillsCast recorded in November 2020)