In the semantics of programming, finite data types such as finite lists, have traditionally been modelled by initial algebras [which satisfy the principle of induction]. Final coalgebras can handle infinite data types. Coalgebras turned out to be suitable models for certain types of automata and more generally, for dynamical systems.
J. J. M. M. Rutten











