Using Structural Recursion for Corecursion

Yves Bertot 1 Ekaterina Komendantskaya 1
1 MARELLE - Mathematical, Reasoning and Software
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : We propose a (limited) solution to the problem of constructing stream values defined by recursive equations that do not respect the guardedness condition. The guardedness condition is imposed on definitions of corecursive functions in Coq, AGDA, and other higher-order proof assistants. In this paper, we concentrate in particular on those non-guarded equations where recursive calls appear under functions. We use a correspondence between streams and functions over natural numbers to show that some classes of non-guarded definitions can 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
Type de document :
Communication dans un congrès
Stefano Berardi and Feruccio Damiani and Ugo de Liguoro. Types 2008, 2008, Torino, Italy. Springer, 5497, pp.220-236, 2008, Lecture Notes in Computer Science
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00322331
Contributeur : Yves Bertot <>
Soumis le : lundi 23 mars 2009 - 13:21:02
Dernière modification le : mercredi 12 septembre 2018 - 01:16:36
Document(s) archivé(s) le : samedi 26 novembre 2016 - 06:36:06

Fichiers

Identifiants

  • HAL Id : inria-00322331, version 4
  • ARXIV : 0903.3850

Collections

Citation

Yves Bertot, Ekaterina Komendantskaya. Using Structural Recursion for Corecursion. Stefano Berardi and Feruccio Damiani and Ugo de Liguoro. Types 2008, 2008, Torino, Italy. Springer, 5497, pp.220-236, 2008, Lecture Notes in Computer Science. 〈inria-00322331v4〉

Partager

Métriques

Consultations de la notice

409

Téléchargements de fichiers

352