A Decision Procedure for Equivalence Relations
Résumé
Equality or equivalence between objects is a typical kind of Coq goal that regularly appears in
theories. When it is a consequence of the context, one can simply rewrite their way through,
but it is more convenient to handle it with a tactic. The congruence tactic by Pierre Corbineau is a decision procedure designed to solve these problems.
One of the limits of congruence is its restriction to the Coq equality eq even for functions
or propositions. This is not structural since the congruence closure method applies equally well
to any equivalence relation. Using equivalence relations would also prompt the tactic to work
with typeclasses and setoids, which are more common in modern Coq code. As an additional
benefit, typeclasses register equivalence relations and let the tactic find them automatically.
Domaines
Logique en informatique [cs.LO]Origine | Fichiers produits par l'(les) auteur(s) |
---|