Pointless puzzle:
A. sum &&& genericLength >>> uncurry (/)
Q. ?
HT @dibblego
-
@dibblego@missingfaktor@techtangents@TheColonial yes, I found it last night but I was surprised by it :)
@steshaw @missingfaktor @techtangents @TheColonial You might want to called it codup since dup :: f a -> f (f a)
-
-
@dibblego@steshaw@techtangents@TheColonial dup (x:xs) = x:x:xs. That's all there's to dup. -
@missingfaktor@steshaw@techtangents@TheColonial The function originally described was dup f a = f a a. Which is join :: m (m a) -> m a - Show replies
New conversation -
-
-
@dibblego@steshaw@techtangents@TheColonial The point-free idioms in concat. languages are quite different. I once translated a ..Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@dibblego@steshaw@techtangents@TheColonial .. bunch of examples from Factor to Haskell, and various applications of `dup` there were ..Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
@dibblego@steshaw@techtangents@TheColonial .. replaced by many combinators from Haskell. (Sadly can't find it atm.)Thanks. 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.