Typing Total Recursive Functions in Coq - ANR - Agence nationale de la recherche Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

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.
Fichier principal
Vignette du fichier
ITP_2017_paper_16.pdf (529.04 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02333333 , version 1 (09-11-2020)

Identifiants

Citer

Dominique Larchey-Wendling. Typing Total Recursive Functions in Coq. Interactive Theorem Proving - 8th International Conference, ITP 2017, Sep 2017, Brasilia, Brazil. pp.371-388, ⟨10.1007/978-3-319-66107-0_24⟩. ⟨hal-02333333⟩
71 Consultations
182 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More