Revision as of 07:57, 24 November 2022 edit 2001:861:3f42:1b60:aefc:b99:1842:a29e (talk) →Pseudo-code in the article ← Previous edit		Revision as of 07:58, 24 November 2022 edit undo SineBot (talk \| contribs) Bots 2,564,891 edits m Dating comment by 2001:861:3F42:1B60:AEFC:B99:1842:A29E - "→Pseudo-code in the article: " Next edit →
Line 162: The equation "(f >=> g) x = (f(x) → mb) >>= g(y = b)" is very confusing, it's unclear where mb and y are bound; I have never seen anything similar. The explanation in this thread is also misguided: x is not a type and there is no substitution happening that forms functors. It makes sense to avoid Haskell-specific notation, but here the only notation used is function application written as "f x", and binary operator "f >=> g". I restored the equation, using f(x) as function application. That should be understandable without additional prerequisites. [[Special:Contributions/2001:861:3F42:1B60:AEFC:B99:1842:A29E\|2001:861:3F42:1B60:AEFC:B99:1842:A29E]] ([[User talk:2001:861:3F42:1B60:AEFC:B99:1842:A29E\|talk]]) <!--Template:Undated--><small class="autosigned">— Preceding [[Wikipedia:Signatures\|undated]] comment added 07:57, 24 November 2022 (UTC)</small> <!--Autosigned by SineBot-->

Talk:Monad (functional programming): Difference between revisions