cursion and induction These are implemented using several layers of recursive definitions and diagonals (i.e., fixed points)."><span class="name">induction</span></a></span><p class="shortcomment cmt">Much of  the richness of HoTT is in the definitions of <code><code>Inductive types</code></code> (and their indexed  counterparts)
and of (dependent) functions on these by recursion and induction
These are implemented using several layers of recursive definitions and diagonals (i.e., fixed points).</p><div cla