Skip to Main content Skip to Navigation
Conference papers

Compositional Coinduction with Sized Types

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Hal Ifip <>
Submitted on : Wednesday, January 25, 2017 - 3:24:20 PM
Last modification on : Wednesday, October 18, 2017 - 9:58:27 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 3:44:17 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads