Haskell - A Peek Inside the Ivory Tower
summary
Shows how Haskell’s IO monad confines side effects while letting most code stay pure, demonstrates newtype wrappers that give zero-cost domain safety, and explains sum types like Maybe/Either for explicit error handling. Gives concrete wins: switching CSV parsing from lazy to strict cuts memory from >1GB to ~180MB; concurrency uses green threads and a simple concurrently call to parallelize web requests. Mentions real-world use (Facebook spam, SEEK), tooling like Hoogle, and recommends Haskell Programming from First Principles.
AI-written summary · about
chapters (14)
- 0:00Start
- 3:39Software quality is a challenge
- 6:51Static typing
- 14:02Sum types
- 31:09Immutability and pure functions
- 32:31Purity in an impure world
- 36:08Value semantics
- 38:56Property testing
- 40:57Laziness
- 45:55Asynchrony and concurrency
- 49:48Type classes and higher-kinded types
- 52:31Optimised for functional programming
- 54:19learning curve
- 57:24Haskell or the Highway?
related talks
01h 22mHaskell for Everyday Programmers
01h 02mHaskell for Java Programmers
55mModern Software Development with Haskell
38mWhat Haskell Taught Us When We Weren't Looking
40mWhat Haskell taught us when we were not looking
53mIntro to Haskell for Erlangers
46mPainless software development with Haskell
45mFunctional Programming bits and pieces