Type safety of rewrite rules in dependent types

Type safety of rewrite rules in dependent types

5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020), Jun 2020, Paris, France. pp.14 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...

Full description

Saved in:
Bibliographic Details
Main Author: Blanqui, Frédéric
Format: Journal Article
Language:English
Published: 30-10-2020
Subjects:
Computer Science - Logic in Computer Science
Computer Science - Programming Languages
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020), Jun 2020, Paris, France. pp.14 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.
DOI:10.48550/arxiv.2010.16111