@posco early sketch of a way to build Aggregators "forwards" similarly to TypedPipe: https://gist.github.com/avibryant/b43d3db8933556001285 …
-
-
Replying to @avibryant
@avibryant this looks good. It is strange that Prepare.map is really a contravariant map though. Why not call that butFirst or contramap?2 replies 0 retweets 1 like -
Replying to @posco
@posco@avibryant this is the Reader monad! (sort of, your flatMap is kinda weird)1 reply 0 retweets 0 likes -
Replying to @jedws
@jedws@avibryant not really. Reader functor, but the motivation is to make building Aggregators easier (Fold.M in the haskell world).1 reply 0 retweets 0 likes -
Replying to @posco
@posco@avibryant just because your def flatMap is weird doesn't prevent it being the Reader monad, there still exists a proper bind for it1 reply 0 retweets 0 likes -
Replying to @jedws
@jedws@avibryant yes but it is not relevant (as I see yet). Functions are monads, yes. But how does that help us here?1 reply 0 retweets 0 likes -
Replying to @posco
@posco@avibryant by defining a weird/illegal flatMap you are likely going to have some very interesting issues1 reply 0 retweets 0 likes -
Replying to @jedws
@jedws@avibryant agree that there should be a distinct name for the T => Traversable[U] Kleisli composition, but scala often confuses the 23 replies 0 retweets 0 likes -
Replying to @avibryant
@avibryant I think@posco is now honor bound to fight you1 reply 0 retweets 0 likes
Avi Bryant Retweeted P. Oscar Boykin
Avi Bryant added,
-
-
Replying to @avibryant
@avibryant@posco reminds me of that old psychologist joke that ends "so who listens ¯\_(ツ)_/¯"
0 replies 0 retweets 0 likesThanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.