[Haskell-cafe] Sets, typeclasses and functional dependencies

[Stuart Hungerford]

On Mon, Aug 2, 2021 at 12:29 PM Richard O'Keefe <raoknz at gmail.com> wrote:

> The thing about powerset is that it is great for reasoning and as a
> starting point
> for a derivation, but horrible as a data structure.   Power sets get
> very big very
> fast, and even in a lazy language, where you might not store an entire powerset,
> traversing one takes a lot of time.  So it's seldom included in
> practical finite set
> implementations.

Very true, although there's something neat about being able to
generate 2^{some set}.

I'm mainly interested in doing the exercises in the "Haskell Road to
Logic and Mathematics" with some added exploration, e.g. a Set
typeclass.


Stu