As a minimum fix I have added the following lead-in to the Idea section (hoping that it will prompt some expert to expand/improve on it):
A category is called algebraically compact if for every endofunctor on it the respective initial algebra coincides with the final coalgebra.
Under categorical semantics of programming languages this condition ensures the existence of inductive-recursive types (e.g. Zamdzhiev 20). For that, recall:
…
As written, the Idea section doesn’t seem to have much content that is specific to algebraic compactness, just very general remarks about data structures being fixed points.
]]>proof sketch that cpo’s and strict maps are algebraically compact
]]>mention example of pointed cpo’s
]]>minor correction and mentioning retracts of solutions
]]>coinduction
]]>include mixed variance
]]>have given some more terms hyperlinks, and added hyperlinked doi-s to the references
]]>page about algebraic compactness.
]]>