One of the nice features of Rust is the match keyword. match is similar to switch, but with two key differences: It requires an exhaustive match, that is, every possible value must be accounted for or

Just running piece of code.. I  had some problems with code from Erik Meijer and Graham Hutton publication from this pdf: Older version of this parser example was used by Erik Meijer in video "C9

I thought I would add a couple of extensions to the Maybe monad to show how using monadic patterns can spread through your code when you start to use them and that is a good thing as they carry much power.

In the last part I created a Maybe monad for C#, a type that allows you to indicate a lack of a value. I pointed out it is like Nullable but better. If you missed the story so far: Introduction Maybe Looking

Apart from the Identity monad, the Maybe monad is probably the easiest to understand so I will start there. In C# think Nullable but able to wrap reference types as well as reference types. I will also

I have done various C# pieces on monads and how C# LINQ is a monad engine. Thought I would put my money where my mouth is and build a monad library and explain the design decisions as I go. In case you

Великий немецкий философ и математик Лейбниц как то высказался, что наш мир - наилучший из всех возможных миров. Каково бы ни было состояние мира, оно всегда является результатом действий всех людей,

In Scala and other typed functional languages – notably Haskell – monads are structures that allow the programmer to take a sequence of computations, each defined for a certain context, and chain them