Haskell Rainbow Type Signature

forall (f :: * → *) (p :: * → * → *) (Choice p, Applicative f) ⇒ p a (f b) → p s (f t)

A black image shows a Haskell type signature with a rainbow beam emerging from the code. The joke treats an abstract type transformation as if it were literally producing a rainbow, a reaction to overly complicated functional programming notation. EN: A black image shows a Haskell type signature with a rainbow beam emerging from the code. The joke treats an abstract type transformation as if it were literally producing a rainbow, a reaction to overly complicated functional programming notation.

• @profunctor_io / 2892 2019-08-23