Snippets tagged Monads
-
Abstracting over 'M'
A higher kind of request to Don Syme... please please please,,,, we desperately need higher kinds!
15 people like this
Like the snippet!Posted: 13 years ago by Nick Palladinos
-
Functor => Applicative => Monad
Yet another attempt of mine to "haskellify" my F# coding.
10 people like this
Like the snippet!Posted: 13 years ago by Nick Palladinos
-
Expression parsing with monads
Compositional expression parsing with monads. https://bitbucket.org/ZachBray/parsad
9 people like this
Like the snippet!Posted: 12 years ago by Zach Bray
-
Delimited continuations
Delimited continuations encoded as a parameterized continuation monad.
1 people like this
Like the snippet!Posted: 10 years ago by Nick Palladinos
-
Reinventing the Reader Monad
Alternative solution to the problem in Scott Wlaschin's "Reinventing the Reader Monad" article (but without monads).
3 people like this
Like the snippet!Posted: 8 years ago by Tomas Petricek
-
The Eff monad
The Eff monad in F#, based on http://okmij.org/ftp/Computation/free-monad.html.
3 people like this
Like the snippet!Posted: 6 years ago by NIck Palladinos
-
Fold functions over static values builder 3
Build strings using powerful higher-rank encoding!
0 people like this
Like the snippet!Posted: 2 years ago by Evgeniy Andreev
-
Monadic Memoization
Modular memoization within a pure functional setting that is implemented as a convenient computation builder.
89 people like this
Like the snippet!Posted: 13 years ago by Nick Palladinos
-
Polymorphic Maybe monad with default value.
Polymorphic (via generics) Maybe monad/computational expression with default value + Zipper
6 people like this
Like the snippet!Posted: 12 years ago by Daniil
-
JSON parsing with monads
JSON parsing with monads. See also "Expression parsing with monads" (http://fssnip.net/bi). Author URL: http://www.zbray.com
8 people like this
Like the snippet!Posted: 12 years ago by Zach Bray
-
A bind/return computation expression that does not satisfy any of the monad laws
A long overdue counterexample of a pure bind/return computation expression that does not satisfy any of the monad laws, as promised to @silverSpoon. This uses binary trees under the hood, which define a binary operation but do not satisfy any unit or associativity laws. Binary trees can also encode the syntactic structure of a computation expression, which is being captured using a state-updating bind implementation.
3 people like this
Like the snippet!Posted: 8 years ago by Eirik Tsarpalis
-
Alternative reader monad
This is a reader monad, whit the difference that multiple reads access different parts of the state. This is done by building up a tuple (in the bind operator) that represents different parts of the state that can be accessed by different parts of the computation.
5 people like this
Like the snippet!Posted: 8 years ago by Tomas Petricek
-
Continuation monad for mortals
Basic implementation of the continuation monad with explanation.
9 people like this
Like the snippet!Posted: 4 years ago by Brian Berns