Type safety of rewrite rules in dependent types
Logic in Computer Science
2020-11-02 v1 Programming Languages
Abstract
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.
Keywords
Cite
@article{arxiv.2010.16111,
title = {Type safety of rewrite rules in dependent types},
author = {Frédéric Blanqui},
journal= {arXiv preprint arXiv:2010.16111},
year = {2020}
}