This is used in the Eq instance and also makes debugging and testing easier.

This is not strictly required by copar but allows for easier testing.

This returns the size of the tree, not the actual number of elements (there can
be more elements per node) and thus should not be in the public API.

This is a requirement for its use in copar and also allows for testing, since
`shouldBe` from hspec requires those two instances.

Due to the way the functor expression is parsed, this led to two nested
polynomial functors when functor rewriting is disabled. Without the parens we
get just one polynomial functor.

Alright, compromise. Word16 might have been a little too small

This should require 4 times less RAM and allow us to generate larger DFAs.

This allows to disable the 1-elem-block optimization to be able to compare the
running times with and with out it.

The same principle as when splitting blocks applies: The largest doesn't
have to be in the queue, because we already refine with respect to it
when refining the second-to-last block.

Checks if all weights are between 0 and 1.

Switches from GADT syntax to a normal ADT. This is more easily presentable in
writing as it doesn't require additional explanation and is shorter.

Although less explicit about the kind of `f`, it is more clear and easier to
replicate in publications.

Creates a new module that exports commonly imported prettyprinter
modules, to cut down on the number of imports each module has to do.

These were originally separated because of some cyclic dependency that
is gone now. So in order to make the module zoo a bit more clear,
merge the two.

(With --no-sanity-checks of course)

This adds --no-sanity-checks to the 'refine' subcommand to pass
DisableSanityChecks to the parser.

Adds a flag to the coalgebra parser that allows individual parsers to
disable all sanity checks on the input.