Towards Corecursion Without Corecursion in Coq - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Towards Corecursion Without Corecursion in Coq


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
EPTCS_Template.pdf (173.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and 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)


  • HAL Id : hal-03689027 , version 1


Vlad Rusu, David Nowak. Towards Corecursion Without Corecursion in Coq. 2022. ⟨hal-03689027v1⟩
88 View
55 Download


Gmail Facebook Twitter LinkedIn More