A higher kind of request to Don Syme... please please please,,,, we desperately need higher kinds!
15 people like thisPosted: 6 years ago by Nick Palladinos
Yet another attempt of mine to "haskellify" my F# coding.
10 people like thisPosted: 5 years ago by Nick Palladinos
Compositional expression parsing with monads. https://bitbucket.org/ZachBray/parsad
8 people like thisPosted: 5 years ago by Zach Bray
Delimited continuations encoded as a parameterized continuation monad.
1 people like thisPosted: 3 years ago by Nick Palladinos
Alternative solution to the problem in Scott Wlaschin's "Reinventing the Reader Monad" article (but without monads).
1 people like thisPosted: 1 years ago by Tomas Petricek
Modular memoization within a pure functional setting that is implemented as a convenient computation builder.
87 people like thisPosted: 6 years ago by Nick Palladinos
Polymorphic (via generics) Maybe monad/computational expression with default value + Zipper
5 people like thisPosted: 5 years ago by Daniil
JSON parsing with monads. See also "Expression parsing with monads" (http://fssnip.net/bi). Author URL: http://www.zbray.com
7 people like thisPosted: 4 years ago by Zach Bray
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 thisPosted: 1 years ago by Eirik Tsarpalis
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.
3 people like thisPosted: 1 years ago by Tomas Petricek