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

F seems to be the canonical name for the functor of an F-coalgebra.

Those functors really require the inverse operation to perform as
required. A separate functor for monoids that aren't groups is
feasable, but would not satisfy the runtime complexity requirements.

Specifically for make, make1 and mark

This makes lexer combinators like `colon` or `parens` a little faster,
which adds up for large inputs.

This cleans up newline handling in the whitespace parser:

Newlines are not treated the same as other whitespace any more and are
only allowed after the functor expression and between individual
morphism points.

By doing this, we get a less surprising grammar for parsing ("x: { y:"
would never try to parse the "y:" as the start of a new definition)
and can speed up the hot path (a single space character) considerably.

The lexer is one of the bottlenecks for parsing. With these
fine-grained benchmarks, we can make more educated guesses about what
to optimize.

Leaving the types entierly abstract is surely more pleasing, but also
the biggest source of slowness.

We're going to add a lot more benchmark modules, so they should follow
the same module hierarchy as the main ones.

I forgot to add them earlier, no idea why CI didn't break...