raasahsan / fx Goto Github PK

A Kleisli arrow is a function of type a -> m b. Kleisli composition is a function of type (a -> m b) -> (b -> m c) -> a -> m c, which is an associative operation.

Alternative is always nice to have, especially w/ Applicative matching DSLs.

Both are useful for iterating over an ADT as if it were a list.

Task[A]

Looks like this currently contains an Ordering type class but is missing an Eq type class. This prevents us from equality comparing two things that aren't necessarily ordered. Can we extract Eq to be it's own thing and also if an Ordering type class exists for a type then can we automatically derive Eq for it?

scala's predef can get in the way of writing conflict-free code sometimes, so we should disable it in scalac options.