Intro to Haskell for Erlangers
summary
Haskell claims practical advantages over Erlang: lightweight threads use half the size of an Erlang process, GHC applies cross-module rewrite rules that fuse maps so high-level code becomes fast, and laziness enables lazy infinite lists and reuse (the Fibonacci example). Tooling demonstrated includes GHCI’s type/info lookup, QuickCheck properties with no macros, Parsec JSON parser, pandoc, and parallel libraries (repa/accelerate/cloudhaskell); examples compile and run, with some caveats around laziness and mutable-state cases.
AI-written summary · about
chapters (22)
- 0:00Start
- 1:00Why Bother Learning Haskell
- 3:17Haskell's Appeal
- 4:20Syntax
- 8:36Pandoc
- 8:55Distributed Revision Control
- 9:20The Haskell Platform
- 10:01Haskell Syntax
- 13:38Record Syntax
- 14:02Abstract Data Types with Recursion
- 14:24Difference between Types and Constructors
- 15:38Pattern Match
- 19:06Edit Reduction
- 19:59Types
- 21:29Type Classes
- 24:42Side Effects
- 26:39List Comprehension
- 28:13Infix Sections
- 37:07Pattern Matching
- 42:17Monoid and Functor
- 50:23When Would Haskell Be Strategically Used in Enterprise
- 51:39Benchmark for Numerical Analysis
related talks
01h 04mHaskell - A Peek Inside the Ivory Tower
40mWhat Haskell taught us when we were not looking
55mModern Software Development with Haskell
38mWhat Haskell Taught Us When We Weren't Looking
57mReal-world Haskell: Good, Bad, & Ugly
02h 38mLazy Evaluation
33mRust and Haskell, sitting in a tree
45mFunctional Programming bits and pieces