Read more

2 of The Best Podcast Episodes for Stephanie Weirich. A collection of podcasts episodes with or about Stephanie Weirich, often where they are interviewed.

Read more

2 of The Best Podcast Episodes for Stephanie Weirich. A collection of podcasts episodes with or about Stephanie Weirich, often where they are interviewed.

Updated daily with the latest episodes

Dependent Types in Haskell with Stephanie Weirich

CoRecursive with Adam Gordon Bell
Episode artwork
Read more

At Strange loop 2017, a wandered into a talk where I saw some code that deeply surprised me. The code could have been python if you squinted, passing dictionaries around, no type annotations anywhere.

Yet key look up in the dictionary was validated at compile time. It was a compile time error to access elements that didn't exist. Also the dictionary was heterogeneous, the elements had different types, and it was all inferred and validated at compile time.

What I was seeing was Dependent types in Haskell. In today's interview Stephanie Weirich explains her efforts to add dependent types to haskell and how that example worked.

Shows Notes:

Jun 13 2018

58mins

Play

Episode 4: Stephanie Weirich on Zombie and Dependent Haskell

The Type Theory Podcast
Episode artwork
Read more
In our fourth episode, we speak with Stephanie Weirich from the University of Pennsylvania on the Zombie language and Dependent Haskell. Stephanie is a long-time contributor to Haskell, having been involved in the design and implementation of features such as generalized algebraic datatypes, higher-rank polymorphism, type families, and promoted datatypes. She has also been a participant in Trellys, a project with the goal of combining proofs and programming in the same language.

Zombie is a different kind of dependently typed language, eschewing automatic β-reduction in the type checker for an approach based on explicit equality rewriting, which enables new ways of combining proofs and programs, as well as new forms of proof automation. Meanwhile, as languages designed for dependently typed programming come closer to practical applicability, Haskell is also moving towards full dependent types. We discuss the challenges and opportunities available at the cutting edge of Haskell.

Apr 18 2015

Play