Introduction to FP Using Haskell (Part 1)
summary
Workshop promises concrete outcomes: install GHC 7.8+ and use GHCi reload to run examples, build small programs that demonstrate lambdas, polymorphic types, pattern matching and algebraic data types, and use deriving Show and Eq to print and compare values. Claim is learn Haskell syntax in 70–90 minutes and, over a six‑hour day, reach comprehension of monads and solve basic problems. Exercises require a laptop with Glasgow Haskell Compiler installed.
AI-written summary · about
chapters (12)
- 0:00Start
- 3:15Install Ghc
- 4:52What Functional Programming Means
- 14:43Who Uses Statically Typed Programming Languages
- 33:40Operators
- 36:51Type Variables
- 38:33Data Types
- 38:55Data Type
- 42:35Semicolons
- 44:39Perimeter of a Shape
- 46:18Case Analysis
- 50:53Pattern Matching
related talks
01h 20mA Practical Introduction to Haskell GADTs
51mPragmatism, Puritanism and Functional Programming
44mFunctional Programming: Failed Successfully
45mFP: The Good, the Bad and the Ugly
43mEverything You Always Wanted to Know About Functional Programming...
58mFunctional Array Funhouse Intensive - Part 2 of 5
27mEffectful
39mA Lazy Scheme In Haskell