Please log in to watch this conference skillscast.
What has dependent type theory done for Haskell? Over the past decade, the Glasgow Haskell compiler (GHC) has adopted many type system features inspired by dependent type theory.
In this talk, Stephanie will discuss the influence of dependent types on the design of GHC and on the practice of Haskell programmers. In particular, she will walk through an extended example and use it to analyze what it means to program with dependent types in Haskell. Throughout, Stephanie will discuss what she has learnt from this experiment in language design: what works now, what doesn't work yet, and what surprised her along the way.
YOU MAY ALSO LIKE:
- Safe and Reproducible Deployments with Immutable Infrastructure (in Online Event on 28th May 2020)
- The Secrets of the GHC Garbage Collector (in Online Event on 11th June 2020)
- Keynote: The Importance of Laughter (SkillsCast recorded in October 2019)
- Fast Code: Save Money By Overcoming Bottlenecks (SkillsCast recorded in October 2019)
Keynote: Dependent Types in Haskell
Stephanie Weirich is a Professor of Computer and Information Science at the University of Pennsylvania. She works in the areas of functional programming, type systems, machine-assisted theorem proving and dependent types. Dr. Weirich has served as the program chair of POPL 2019, ICFP 2010 and the 2009 Haskell Symposium. Her awards include the 2016 Most Influential ICFP Paper award (for 2006) for the paper "Simple unification-based type inference for GADTs" and the 2016 ACM SIGPLAN Robin Milner Young Researcher Award.