Yes, the handle is a joke about the number of monad tutorials already written. I write Haskell, think about types, and try to explain things without the word "burrito".
Current obsession: what makes a type class law useful rather than decorative.
Yes, the handle is a joke about the number of monad tutorials already written. I write Haskell, think about types, and try to explain things without the word "burrito".
Current obsession: what makes a type class law useful rather than decorative.
Forty-seven and counting. I will be the first to read number forty-eight.
Can you tell me what a monad is in one sentence without an analogy? Asking for a friend who has bounced off four of those tutorials.
Challenge accepted: a monad is a way to chain computations where each step may produce extra structure (a failure, a log, a state, several results), with a rule for how that structure is combined. Maybe chains steps that may fail; List chains steps that may return several answers. The laws say that chaining behaves sensibly. That is the one sentence. The rest is practice.