If not, the type checker will issue type checking errors when the functor is analyzed.
Most spelling checkers on the market nowadays also provide suggestions to replace a detected error.
Ultimately, one would like to present them in the form of proof scripts for some automated proof checker.
As in the real final verifier of our case study, this is a type-based checker.
These rules are used to generate errors automatically, and to test spelling checkers' error coverage and suggestion adequacy for the relevant error types.
A second improvement could be obtained by running a spell checker that proposes automatic corrections on the labels.
The implemented equivalence checker is an optimized version of the one presented above.
The checker does not attempt to parse sentences fully.
