type-classes.dot

digraph G {
  rankdir=BT;
  node [fontname="arial"];
  node [style=filled,color=black,fillcolor="#B3ABF4"];
  "Strong" -> "Profunctor"
  "Choice" -> "Profunctor"
  node [style=filled,color=black,fillcolor="#FC81BF"];
  "Monoid" -> "Semigroup"
  node [style=filled,color=black,fillcolor="#FDF4AA"];
  "Field" -> "Ring" -> "Semiring"
  node [style=filled,color=black,fillcolor="#FC81BF"];
  "Ord" "Setoid"
  node [style=filled,color=black,fillcolor="#FECFE6"];
  "Bounded" -> "Ord" -> "Setoid"
  node [style=filled,color=black,fillcolor="#FDF4AA"];
  "Category" -> "Semigroupoid"
  node [style=filled,color=black,fillcolor="#659DFE"];
  "Functor" "Applicative" "Monad" "Alternative" "Traversable" "Foldable" "Compactable"
  node [style=filled,color=black,fillcolor="#BFD7FF"];
  "Profunctor" -> "Functor"
  "Alt" -> "Functor"
  "Alternative" -> "Applicative"
  "Alternative" -> "Plus" -> "Alt"
  "Monad" -> "Applicative" -> "Apply" -> "Functor"
  "Monad" -> "Chain" -> "Apply"
  "ChainRec" -> "Chain"
  "Comonad" -> "Extend" -> "Functor"
  "Traversable" -> "Foldable"
  "Traversable" -> "Functor"
  "Filterable" -> "Functor"
  "Filterable" -> "Compactable"
  "Witherable" -> "Traversable"
  "Witherable" -> "Filterable"
  node [style=filled,color=black,fillcolor="#FDF4AA"];
  "BooleanAlgebra" -> "HeytingAlgebra" -> "BoundedDistributiveLattice" -> "BoundedLattice" -> "BoundedJoinSemilattice"
  "BoundedDistributiveLattice" -> "DistributiveLattice" -> "Lattice" -> "JoinSemilattice"
  "Lattice" -> "MeetSemilattice"
  "BoundedJoinSemilattice" -> "JoinSemilattice"
  "BoundedLattice" -> "BoundedMeetSemilattice" -> "MeetSemilattice"
}