> We provide a bidirectional type checking algorithm (ğ5), at the heart of our implementation,
which exploits an SMT solver to discharge theorems over the indices of graded modalities.
а ну это я бы не назвал классическим state-exploration модел-чекингом