I have been remiss in updating here. Since the last time I posted, I have posted:

Lecture 6, featuring some interesting limits and colimits, culminating in the introduction of adjoints.

Lecture 7, featuring the introduction of monads based in adjoints, with the connection between the *monoid of endofunctors* and the Haskellite specification of monads.

Lecture 8, featuring Eilenberg-Moore algebras, initial algebras for datatype specification, Lambek’s lemma and structural induction and recursion with endofunctor algebras.

Hi. I think that we should use isomorphism (?) in “P(I)=I” and “I = 1 + A×I” in the Lecture 8. Thus clarifying why are we proving that ?f,a? is an isomorphism pair.