Example. Recursive domain equations as endofunctors [dt-004N]

Liam O'Connor

This recursive equation for lists: $L \simeq \mathbf {1} + (\mathbb {Z}_\bot \times L)$ Can be expressed as the least fixed point of this mapping (specifically an endofunctor) $\mathcal {F}$ on cpos: $\mathcal {F}(A) \triangleq \mathbf {1} + (\mathbb {Z}_\bot \times A)$

Example. Recursive domain equations as endofunctors [dt-004N]

Recursive algebraic data types [dt-004L]

Untyped higher-order languages [dt-004M]

Definition. Untyped $\lambda$ -calculus [dt-004K]

Example. Recursive domain equations as endofunctors [dt-004N]