Cardinalities of Finite Relations in Coq (Rough Diamond)
Résumé
We present an extension of a Coq library for relation algebras , where we provide support for cardinals in a point-free way. This makes it possible to reason purely algebraically, which is well-suited for mechanisation. We discuss several applications in the area of graph theory and program verification.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)