A Coq Library of Undecidable Problems
Résumé
We propose a talk on our library of mechanised reductions to establish undecidability results in Coq. The library is a collaborative effort, growing constantly and we are seeking more outside contributors willing to work on undecidability results in Coq.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...