Type safety of rewrite rules in dependent types

October 30, 2020 · The Ethereal · 🏛 International Conference on Formal Structures for Computation and Deduction

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Frédéric Blanqui arXiv ID 2010.16111 Category cs.LO: Logic in CS Cross-listed cs.PL Citations 17 Venue International Conference on Formal Structures for Computation and Deduction Last Checked 2 months ago
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.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Logic in CS