Talk: (English)
Dependent Types in Haskell
Why should programmers care about dependent types?
Over the past decade, the Haskell compiler GHC has incorporated a number of new type system features inspired by dependent type theory. In this talk, I will motivate this work and demonstrate the benefits of these features through an extended example of a Haskell library for regular expression matching. In the process, I will use this example to analyze what it means for a practical programming language to be “dependently typed.”
Stephanie Weirich
Stephanie Weirich is a Professor of Computer and Information Science at the University of Pennsylvania. She joined Penn after receiving her Ph.D. from Cornell University in 2002. 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) and the 2016 ACM SIGPLAN Robin Milner Young Researcher Award.
- Slides
- stephanie-weirich.pdf
