[Haskell-cafe] Basic question concerning data constructors

[ajb at spamcop.net]

G'day all.

Quoting Yitzchak Gale <gale at sefer.org>:

> Data types consist only of computable elements. Since there
> are only countably many computable functions, every data type
> has at most countably many elements. In particular, it is a set.

I still say it "isn't a set" in the same way that a group "isn't a set".
Haskell data types have structure that is respected by Haskell
homomorphisms.  Sets don't.

Cheers,
Andrew Bromage