Talk:Monad (functional programming): Difference between revisions

Revision as of 22:40, 27 October 2022

Revision as of 22:44, 27 October 2022

Line 135:

:2: The right hand side is

::'''Let''' functor <code>(f(x) → mb)</code> '''be''' the functor resulting from substituting mb for y in g;

{{anchor|klComposeOper}}The Kleisli compose operator <code>>=></code> means if some m >>= f then f is the continuation of m.<ref name= gg >[https://www.haskellforall.com/2012/12/the-continuation-monad.html? showComment=1424959716748#c3272667111873173855 Memetic Warrior (26 Feb 2015) reply to] [https://www.haskellforall.com/2012/12/the-continuation-monad.html? Gabriel Gonzalez, Haskell for All (30 Dec 2012) The Continuation Monad] </ref>

-- [[User:Ancheta Wis|Ancheta Wis]] [[User talk:Ancheta Wis| &nbsp; (talk]] [[Special:Contributions/Ancheta Wis| &#124; contribs)]] 18:59, 27 October 2022 (UTC)

{{anchor|akContin}}Alexis King<ref name=alexisKing >[https://github.com/lexi-lambda Alexis King, github]</ref> notes that if m >>= f >>= g >> h then the continuation of m is f >=> g >=> h <ref name= lexiLambda >[https://gist.github.com/lexi-lambda/d97b8187a9b63619af29689e9fa1b880 lexi-lambda/continuations-and-reduction-semantics.md]</ref> --[[User:Ancheta Wis|Ancheta Wis]] [[User talk:Ancheta Wis| &nbsp; (talk]] [[Special:Contributions/Ancheta Wis| &#124; contribs)]] 19:18, 27 October 2022 (UTC)

{{talkref}}