Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2020.13
URN: urn:nbn:de:0030-drops-123353
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12335/
Blanqui, Frédéric
Type Safety of Rewrite Rules in Dependent Types
| pdf-format: |
|
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.
BibTeX - Entry
@InProceedings{blanqui:LIPIcs:2020:12335,
author = {Fr{\'e}d{\'e}ric Blanqui},
title = {{Type Safety of Rewrite Rules in Dependent Types}},
booktitle = {5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)},
pages = {13:1--13:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-155-9},
ISSN = {1868-8969},
year = {2020},
volume = {167},
editor = {Zena M. Ariola},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12335},
URN = {urn:nbn:de:0030-drops-123353},
doi = {10.4230/LIPIcs.FSCD.2020.13},
annote = {Keywords: subject-reduction, rewriting, dependent types}
}
| Keywords: | subject-reduction, rewriting, dependent types | |
| Seminar: | 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020) | |
| Issue date: | 2020 | |
| Date of publication: | 28.06.2020 | |
| Supplementary Material: | https://github.com/wujuihsuan2016/lambdapi/tree/sr |
