Please log in to watch this conference skillscast.
Static type systems are wonderful, but they have their limits, and then you reach for dynamic type and run-time type checks. Haskell has had dynamic types for ages, in the form of the Typeable class, but recent developments has made it feasible to support type-indexed type run-time type representations. That in turn makes it possible to support dynamic typing as an ordinary Haskell library, using a very small, sharply-focused language extension. It turns out that doing this really pushes the envelope on what is possible with static type systems. Not only do you need higher kinds, kind polymorphism, and GADTs, but also kind equalities, and even heterogeneous kind equalities! It’ll be fun. And it’s all in GHC 8.0.
YOU MAY ALSO LIKE:
- Fast Track to RESTful Microservices (in London on 24th - 26th May 2017)
- Whole Team Approach to Agile Testing (in London on 5th - 7th June 2017)
- Alberto Brandolini's DDD Modelling Workshop (in London on 26th - 28th June 2017)
- µCon 2017: The Microservices Conference (in London on 6th - 7th November 2017)
A reflection on types - Simon Peyton Jones, Microsoft Research
Simon Peyton Jones, MA, MBCS, CEng, graduated from Trinity College Cambridge in 1980. Simon was a key contributor to the design of the now-standard functional language Haskell, and is the lead designer of the widely-used Glasgow Haskell Compiler (GHC). He has written two textbooks about the implementation of functional languages.