Content deleted Content added
→Pseudo-code in the article: whoops. wrong indent |
|||
Line 159:
:: Firstly, sorry for replacing the pseudo-code with Haskell code without reading the talk page first: I didn't realize there was an effort to avoid Haskell code. I will say though I found the pseudo-code confusing. My feeling (for what it's worth) is that psuedo-code that has no clear meaning to most people defeats the point of pseudo-code and you're better off going with an actual language like Haskell. [[User:Nbrader|Nbrader]] ([[User talk:Nbrader|talk]]) 01:21, 30 October 2022 (UTC)
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]])
| |||