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.
Talks I've Given
-
Strongly Typed System F in GHC
Featuring Stephanie Weirich
There are many examples that demonstrate how to create a strongly typed abstract syntax in Haskell for a language with a simple type system. But there are many fewer examples that allow the embedded language to be polymorphic. I will work through what it takes to do so, touching on variable...
haskell -
Keynote: Dependent Types in Haskell
Featuring Stephanie Weirich
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.
keynote ghc dependent-type-theory types functional-programming haskellx haskell