Type Safety of Rewrite Rules in Dependent Types
Frédéric Blanqui · arXiv (Cornell University) · 2020
The expressiveness of dependent type theory can be extended by identifying types modulo some additional computation rules. But, for preserving the decidability of type-checking or the logical consistency of the system, one must make sure that those user-defined rewriting rules preserve typing. In this paper, we give a new method to check that property using Knuth-Bendix completion.