Typing Total Recursive Functions in Coq
Construire les fonctions récursives totales en Coq
Résumé
We present a (relatively) short mechanized proof that Coq types any recursive function which is provably total in Coq. The well-founded (and terminating) induction scheme, which is the foundation of Coq recursion, is maximal. We implement an unbounded minimization scheme for decidable predicates. It can also be used to reify a whole category of undecidable predicates. This development is purely constructive and requires no axiom. Hence it can be integrated into any project that might assume additional axioms.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...