Towards Corecursion Without Corecursion in Coq - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

Towards Corecursion Without Corecursion in Coq

Résumé

Coinduction is an important concept in functional programming. To formally prove properties of corecursive functions one can try to define them in a proof assistant such as Coq. But there are limitations on the functions that can be defined. In particular, corecursive calls must occur directly under a call to a constructor, without any calls to other recursive functions in between. In this paper we show how a partially ordered set endowed with a notion of approximation can be organized as a Complete Partial Order. This makes it possible to define corecursive functions without using Coq's corecursion, as the unique solution of a fixpoint equation, thereby escaping Coq's builtin limitations.
Fichier principal
Vignette du fichier
wpte2022.pdf (236.2 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03689027 , version 1 (06-06-2022)
hal-03689027 , version 2 (27-06-2022)
hal-03689027 , version 3 (30-06-2022)
hal-03689027 , version 4 (15-08-2022)

Identifiants

  • HAL Id : hal-03689027 , version 4

Citer

Vlad Rusu, David Nowak. Towards Corecursion Without Corecursion in Coq. 2022. ⟨hal-03689027v4⟩
133 Consultations
71 Téléchargements

Partager

Gmail Facebook X LinkedIn More