Learn Haskell’s core idiom: higher-order functions. Replace manual recursion with `map`, `filter`, `fold`, lambdas, partial application, and clear function-composition pipelines.
Overview
Syllabus
- Unit 1: Functions and Partial Application
- Applying Functions Twice
- Building Smaller Functions from Bigger Ones
- Unit 2: Transforming Lists with map
- Doubling Numbers with map
- Marking Big Numbers with Partial Application
- Shouting Strings with map
- Unit 3: Selecting Elements with Filter
- Picking Out the Even Numbers
- Keeping Only the Big Numbers
- Filtering with Your Own Predicate
- Unit 4: Anonymous Functions with Lambdas
- Tripling Numbers with a Lambda
- Filtering Multiples with a Lambda
- Unit 5: Reducing Lists with Fold
- Summing a List with Fold
- Finding the Largest with Fold
- Counting Items with a Lambda Fold
- Unit 6: Composing Functions into Pipelines
- Gluing Functions into a Pipeline
- Summing the Even Numbers Together