Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a calculational approach to designing type checkers through this 46-minute conference presentation from Haskell 2025. Learn how to derive type checkers from behavioral specifications using equational reasoning, with a focus on languages whose semantics can be expressed as folds. Discover how calculations can be simplified using fold fusion techniques, enabling compositional derivation of correct-by-construction type checkers based on solving and composing fusion preconditions. Follow the methodology as it's introduced through a simple expression language, then see how it extends to support exception handling and checked exceptions. Gain insights from researchers at the University of Nottingham and IT University of Copenhagen as they demonstrate this systematic approach to type checker construction that ensures correctness through mathematical derivation rather than testing.
