Existential vs. Universally quantified types in Haskell
The terms “universal” and “existential” here come from the similarly-named quantifiers in predicate logic. Universal quantification is normally written as ∀, which you can read as “for all”, and means roughly what it sounds like: in a logical statement resembling “∀x. …” whatever is in place of the “…” is true for all possible “x” … Read more