Check pattern match exhaustiveness, since we don't really handle that in source code.

This is pretty easy because of how patterns work in Kempe.

Some of this code is from Dickinson, but we don't need the Maranget approach because the pattern matching is simpler in Kempe.