3 ms·
More generally, functor sum and products allow composition of recursive data types. The cofree comonad, which Brian describes, is a special case of a functor s
by willtim 10y ago
More generally, functor sum and products allow composition of recursive data types. The cofree comonad, which Brian describes, is a special case of a functor sum.