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: