The Haskeller's Library

|
λ

Explore the Collection

Fundamentals

Lambda Calculus

The mathematical foundation of all functional programming. Every Haskell expression is, at its core, a lambda term waiting to be reduced.

-> Explore
Type Theory

Functors

Lift a function into a computational context. Functors let you map over structures without breaking them apart.

-> Study
Advanced

Monads

Sequence computations with context. Monads are not scary -- they are the elegant answer to the question of structured effects.

-> Understand
Patterns

Pattern Matching

Deconstruct data with precision. Pattern matching makes complex branching logic read like a mathematical definition.

-> Practice
Type Classes C

Typeclasses

Principled ad-hoc polymorphism. Define interfaces that types can implement, enabling generic programming with type safety.

-> Discover
Beginner

Immutability

Values do not change. Once bound, a name refers to the same thing forever. This simple principle unlocks fearless concurrency.

-> Begin
λ