Questions tagged [f-algebras]

Question Define the type constructor F in Haskell like this: data BTree a = Leaf a | Branch (BTree a) (BTree a) data F a = F (Maybe (BTree a)) The type constructor F is polynomial, so it is a Functor, an Applicative, a Traversable, but not…