Foundational Extensible Corecursion: A Proof Assistant Perspective

Abstract : This paper presents a formalized framework for defining corecursive functions safely in a total setting, based on corecursion up-to and relational parametricity. The end product is a general corecursor that allows corecursive (and even recursive) calls under "friendly" operations, including constructors. Friendly corecursive functions can be registered as such, thereby increasing the corecursor's expressiveness. The metatheory is formalized in the Isabelle proof assistant and forms the core of a prototype tool. The corecursor is derived from first principles, without requiring new axioms or extensions of the logic.
Type de document :
Communication dans un congrès
ICFP 2015, Aug 2015, Vancouver, Canada. 2015, Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, ICFP 2015, Vancouver, BC, Canada, September 1-3, 2015. 〈10.1145/2784731.2784732〉
Liste complète des métadonnées

Littérature citée [60 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01212589
Contributeur : Jasmin Christian Blanchette <>
Soumis le : mercredi 7 octobre 2015 - 15:28:47
Dernière modification le : lundi 20 novembre 2017 - 15:14:02
Document(s) archivé(s) le : vendredi 8 janvier 2016 - 10:16:02

Fichier

fouco.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Jasmin Christian Blanchette, Andrei Popescu, Dmitriy Traytel. Foundational Extensible Corecursion: A Proof Assistant Perspective. ICFP 2015, Aug 2015, Vancouver, Canada. 2015, Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, ICFP 2015, Vancouver, BC, Canada, September 1-3, 2015. 〈10.1145/2784731.2784732〉. 〈hal-01212589〉

Partager

Métriques

Consultations de la notice

117

Téléchargements de fichiers

56