Talk:Monad (functional programming): Difference between revisions

Revision as of 01:08, 29 October 2022

Revision as of 00:40, 30 October 2022

Line 155:

@[[user:Zar2gar1]], Thank you for your pseudocode in the article, which attempts to accomodate the requests of the readership to avoid Haskell. Because of the objections above, I propose the use of Bartosz Milewski's 2019 book ''Category Theory for Programmers'' pages 202 through 205, which uses Haskell notation to explain Kleisli composition <code>>=></code> . Dr. Milewski uses Kleisli composition <code>>=></code> and <code>return</code> to implement Monad. In fact Dr. Milewski implements Monad in Haskell three ways on those pages. --[[User:Ancheta Wis|Ancheta Wis]] [[User talk:Ancheta Wis| &nbsp; (talk]] [[Special:Contributions/Ancheta Wis| &#124; contribs)]] 01:08, 29 October 2022 (UTC)

: @"which is it": The two alternatives have the same meaning. Even more: They already have identical parse trees. --[[User:Daniel5Ko|Daniel5Ko]] ([[User talk:Daniel5Ko|talk]]) 00:40, 30 October 2022 (UTC)