https://hal.inria.fr/hal-01446030Abel, AndreasAndreasAbelGU - University of Gothenburg Compositional Coinduction with Sized TypesHAL CCSD2016[INFO] Computer Science [cs]Ifip, HalIchiro Hasuo2017-01-25 15:24:202017-10-18 09:58:272017-01-25 15:31:57enConference papershttps://hal.inria.fr/hal-01446030/document10.1007/978-3-319-40370-0_2application/pdf1Proofs 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.