I'm super not well-versed in all this so please bear with me. Are Algebraic Effects an extension of Extensible Effects? Or are they a completely different approach? I looked up Algebraic Effects and was surprised to quickly find a transparent-to-me explainer so I think I vaguely get what they are about. (It was this overreacted.io/algebraic-effects-for-the-rest-of-us/ and seemed pretty sensible to me)
@@robertavram11 I almost figured as much. I'd love to have, like, a comparison/reasonably-detailed-but-generally-understandable explanation though. If you happen to know any of those, could you please share links to them? If I understand it right, algebraic effects do the same thing to effects as dependent type theory does to types? Making effects "first class"? Are they still modeled by monads then?
@@Kram1032I sadly don't know of any explicit piece of literature that compares them to that extent. But to answer your question, yes. For algebraic effects, broadly speaking, effectful computation is made first class and the language gives you the opportunity to handle individual outcomes of an effect and their nfluence in the program. Simply put you do the effect (try) and then decide how to handle it (catch) without deterring your initial computation.
