Compositional Coinduction with Sized Types - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Compositional Coinduction with Sized Types

Andreas Abel
  • Function : Author
  • PersonId : 999351


Proofs by induction on some inductively defined structure, e. g., finitely-branching trees, may appeal to the induction hypothesis at any point in the proof, provided the induction hypothesis is only used for immediate substructures, e. g., the subtrees of the node we are currently considering in the proof. The basic principle of structural induction can be relaxed to course-of-value induction, which allows application of the induction hypothesis also to non-immediate substructures, like any proper subtree of the current tree. If course-of-value induction is not sufficient yet, we can resort to define a well-founded relation on the considered structure and use the induction hypothesis for any substructure which is strictly smaller with regard to the constructed relation.
Fichier principal
Vignette du fichier
418352_1_En_2_Chapter.pdf (121.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01446030 , version 1 (25-01-2017)





Andreas Abel. Compositional Coinduction with Sized Types. 13th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2016, Eindhoven, Netherlands. pp.5-10, ⟨10.1007/978-3-319-40370-0_2⟩. ⟨hal-01446030⟩
48 View
134 Download



Gmail Facebook Twitter LinkedIn More