#### Topic: Monads

Prompt good and rather simple presentation/slides with an explanation of monads.

You are not logged in. Please login or register.

Prompt good and rather simple presentation/slides with an explanation of monads.

Hello, _NN _, you wrote: _NN> Prompt good and rather simple presentation/slides with an explanation of monads. Here transfer

Hello, _NN _, you wrote: _NN> Prompt good and rather simple presentation/slides with an explanation of monads. Present that monads = bureaucracy, with all that it implies. However, when there are necessary papers, it is possible to do much that

Hello, deniok, you wrote: D> Hello, _NN _, you wrote: _NN>> Prompt good and rather simple presentation/slides with an explanation of monads. D> here D> transfer With this sign, thanks. It is necessary to make from this presentation simply probably.

Hello, deniok, you wrote: D> here D> transfer and whether is an explanation of monads through ?

Hello, neFormal, you wrote: F> Hello, deniok, you wrote: D>> here D>> transfer F> and whether is an explanation of monads through ? Can look for Scala. Library Scalaz. It is possible to esteem a blog: http://bartoszmilewski.com/category/monads/, here it is compared with With ++. Well and at last RSDN: http://rsdn.ru/forum/philosophy/5831840.1 the Author: AlexRK Date: 26.10 22:20 http://rsdn.ru/forum/philosophy/5380969.1 the Author: dimgel Date: 03.12.13

Hello, _NN _, you wrote: F>> and whether there is an explanation of monads through ? _NN> Can look for Scala. Library Scalaz. _NN> It is possible to esteem a blog: http://bartoszmilewski.com/category/monads/, here it is compared with With ++. Aha, here it did not see. Thanks. The remaining read and somehow not that. Through the code it is understood better, than in vast reasonings.

Hello, neFormal, you wrote: F> and whether there is an explanation of monads through ? It is possible to look at asynchronous calculations in F#. In textbooks on this language anywhere the terrible word "monad", but type Async <' T> by a monad, as a rule, is not mentioned and is. Moreover, there is good syntactic for it, and generalize which can be applied and to other monads, including, own. On my observations the material rather simply is acquired. There a counter that to to sugar bring gradually through sequences, and many already know about them on C# and a key construction yield return. Besides, in a python there are generators. And so, in F# there is an own syntactic sugar which works simultaneously both for sequences, and for monads. Without syntactic sugar convenient in usage there is no special practical sense in monads at my private sight. Normally person at first to learn to use sequences and asynchronous calculations. If experience appears successful, that is every chance to learn to create and own monads in F#. Such way to understanding of monads through initiating accustoming to sugar is not especial. If to take book Real World Haskell there too at first learn to how to usage the notation do, and only bring to monads much later. P.S. And, generally, I perceive monads as one of types of calculations. Calculation turns that calculates, and consequently parametric type M <' a>. Calculations can be created from primitives, and consequently function return. Calculation it is possible to connect to its continuation, and consequently function bind.

Hello, dsorokin, you wrote: D> There a counter that to to sugar bring gradually through sequences, and many already know about them on C# and a key construction yield return. Besides, in a python there are generators. Yes, interesting thought. The list f-tsy, as in a monad. Only sugar does not suffice. D> if to take book Real World Haskell there too at first learn to how to usage the notation do, and only bring to monads much later. And if to take learnyou, there on the contrary. At first F-TORUSES, then already monads. And after all does not hinder.

Hello, _NN _, you wrote: _NN> Prompt good and rather simple presentation/slides with an explanation of monads. Not presentation, but very quite good video