The Rewster: Type Preserving Rewrite Rules for the Coq Proof Assistant - Ecole Normale Supérieure paris-Saclay
Communication Dans Un Congrès Année : 2024

The Rewster: Type Preserving Rewrite Rules for the Coq Proof Assistant

Résumé

In dependently typed proof assistants, users can declare axioms to extend the ambient logic locally with new principles and propositional equalities governing them. Additionally, rewrite rules have recently been proposed to allow users to extend the logic with new definitional equalities, enabling them to handle new principles with a computational behaviour. While axioms can only break consistency, the addition of arbitrary rewrite rules can break other important metatheoretical properties such as type preservation. In this paper, we present an implementation of rewrite rules on top of the Coq proof assistant, together with a modular criterion to ensure that the added rewrite rules preserve typing. This criterion, based on bidirectional type checking, is formally expressed in PCUIC --- the type theory of Coq recently developed in the MetaCoq project.
Fichier principal
Vignette du fichier
LIPIcs.ITP.2024.26.pdf (775.95 Ko) Télécharger le fichier
Origine Publication financée par une institution
licence

Dates et versions

hal-04511667 , version 1 (19-03-2024)
hal-04511667 , version 2 (18-09-2024)

Licence

Identifiants

Citer

Yann Leray, Gaëtan Gilbert, Nicolas Tabareau, Théo Winterhalter. The Rewster: Type Preserving Rewrite Rules for the Coq Proof Assistant. International Conference on Interactive Theorem Proving (ITP 2024), Yves Bertot; Temur Kutsia; Michael Norrish, Sep 2024, Tbilisi, Georgia. pp.18, ⟨10.4230/LIPIcs.ITP.2024.26⟩. ⟨hal-04511667v2⟩
167 Consultations
94 Téléchargements

Altmetric

Partager

More