I'm delighted with how many people have been trying out Magnolia already! The Gitter channel (https://gitter.im/propensive/magnolia/ …) has been active all day. :)
-
Take all the `A`s from any `Type[A]` and apply the given function to it. Turning it into a `Type [B]`
I think I may actually be one step closer after a change I made this afternoon. :)
-
-
Check kittens MkFunctor ;) but globally, take List[A], decompose it into product Nil, Cons... Then decompose Cons, there is head A which can be Functor bearer and tail List[A] which is recursive...
-
Decompose into coproduct is better...
End of conversation
New conversation -
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.