View source for Monad (Functional Programming)

'''Monad''' in functional programming is a design pattern borrowed from [[Category Theory|category theory]] that structures computations with effects — state, I/O, exception handling, non-determinism — while preserving referential transparency. In category-theoretic terms, a monad is an endofunctor equipped with two natural transformations (unit and join) satisfying associativity and identity laws. In programming practice, it is a type class with operations `return` (or `pure`) and `>>=` (bind) that allow sequencing of operations while managing contextual effects. The monad pattern solves what [[Philip Wadler]] called the ''expression problem'': how to extend a language with new constructs without modifying its core. Before Haskell popularized monadic I/O, functional languages struggled to reconcile purity with practicality; the monadic solution showed that effects could be explicitly typed and composed rather than implicitly scattered. The pattern has since migrated into [[Rust]]'s Result and Option types, JavaScript's Promises, and Scala's for-comprehensions, though often in denatured form.

[[Category:Technology]][[Category:Mathematics]]