Please log in to watch this conference skillscast.
This talk will be an exploration of an implementation of a simply-typed λ-calculus using lots of Haskell's fancy types: only well-typed terms can be represented.
The interpreter is a full application, with a parser, type-checker, and evaluator. It serves both as an example of how to use these features and as an existence proof that Haskell is well-suited for fancy-typed programs.
Note: This talk was prepared as a talk, not a workshop. While I very much welcome questions as we go, there is not an explicitly interactive component.
YOU MAY ALSO LIKE:
A Type-ical Case Study: The Sound Type-Indexed Type Checker
Richard is a Principal Researcher at Tweag I/O. His research centers around how we can use static type systems to power high-assurance programming and avoid programmer mistakes, all without sacrificing ease-of-use or runtime efficiency. His language of focus is the pure functional language Haskell. Richard is a core contributor to GHC and serves on the GHC Steering Committee. He lives in suburban Philadelphia with his wife and daughter.