MathDB1 problem
- 0 votes0 replies0 views
Strong normalization of the rewrite system with Agda definitional equality
The rewrite system consists of the preceding rewriting rules for the monadic operations and type constructors. Together with Agda's definitional equality, the system is conjectured…