Using Structural Recursion for Corecursion - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2008

Using Structural Recursion for Corecursion

Yves Bertot

Résumé

We address the problem of constructing stream values de- fined by recursive equations that do not respect directly the “guarded- ness” condition, and we concentrate in particular on equations where recursive call appear under functions. We use a correspondence between streams and functions over natural numbers to show that some classes of non-guarded definitions can still be modelled through the encoding as structural recursive functions. In practice, this work extends the class of stream values that can be defined in a constructive type theory-based theorem prover with inductive and coinductive types, structural recursion and guarded corecursion.
Fichier principal
Vignette du fichier
fibonacci.pdf (182.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00322331 , version 1 (17-09-2008)
inria-00322331 , version 2 (18-09-2008)
inria-00322331 , version 3 (22-09-2008)
inria-00322331 , version 4 (23-03-2009)

Identifiants

  • HAL Id : inria-00322331 , version 3

Citer

Yves Bertot, Ekaterina Komendantskaya. Using Structural Recursion for Corecursion. 2008. ⟨inria-00322331v3⟩
323 Consultations
619 Téléchargements

Partager

Gmail Facebook X LinkedIn More