In the typed functional programming communities, there is much talk about “reasoning with types”. But rarely is this elaborated into something concrete. Just how can we extract tangible information from types beyond playing mere type tetris? The secret sauce is called parametricity, first described by John C. Reynolds, and later applied to Haskell by Philip Wadler in his seminal paper “Theorems for free!”.
Click to focus, then use left and right arrow on your keyboard to navigate (or swipe on mobile).
- MuniHac, Munich, Germany, September 11th, 2020
- Haskell eXchange, Online, November 5th, 2020
- INNOQ Technology Day, Online, December 9th, 2020
- BOB, Online, February 26th, 2021