Algebraic Thinking for evolution of pure functional domain models
summary
Argues that domain models should be defined as algebras — a carrier type, operations, laws — and shows, with standard library examples, how small algebras compose into larger ones so business rules become law‑checked types rather than ad hoc code. Emphasizes parametricity and compositionality as design tools and models side effects via algebraic effects. Applies the approach to a concrete domain use case, composes the full model from those algebras, and produces a working, purely algebraic model.
AI-written summary · about
chapters (5)
- 0:00Introduction and welcome
- 10:10Algebraic thinking in programming
- 25:26Model composition and behavior
- 35:10Side effects and functional purity
- 44:46Summary and closing remarks
related talks
52mFunctional Patterns in Domain Modeling
17mFunctional Architecture is Algebraic Architecture
31mAlgebraic Data Types, Categorically
51mDomain Modeling Made Functional
25mArt of Domain Modeling
15mModular Probabilistic Models via Algebraic Effects
49mDomain Modeling Made Functional
34mPatterns of a pragmatic functional architecture