Keynote: Dependently-Typed Haskell - Stephanie Weirich
Channel: Typelevel
Date: 2016-04-14

Is Haskell a dependently typed programming language? The Glasgow Haskell Compiler's many type-system features, such as Generalized Algebraic Datatypes (GADTs), datatype promotion, multiparameter type classes, type families, and more recent extensions give programmers the ability to encode domain-specific invariants in their types. Clever Haskell programmers have used these features to enhance the reasoning capabilities of static type checking. But how far have we come? Could we do more?

* Material *

Slides: http://www.cis.upenn.edu/~sweirich/talks/typelevel16.pdf

* Event * 

Typelevel Summit Philadelphia, March 2016: http://typelevel.org/event/2016-03-summit-philadelphia/

* About Speaker *

Stephanie Weirich is a Professor at the University of Pennsylvania. Her research centers on programming languages, type theory and machine-assisted reasoning. In particular, she studies generic programming, metaprogramming, dependent type systems, and type inference in the context of functional programming languages. She is currently an Editor of the Journal of Functional Programming and served as the program chair for ICFP in 2010 and the Haskell Symposium in 2009.

* Licensing *

This recording is licensed under CC-BY 4.0 (https://creativecommons.org/licenses/by/4.0/).

Title image: Ryan Hallock on Flickr, https://flic.kr/p/tCR6T1, licensed under CC-BY 2.0