Pete resume for codata (where comonad is a "type of input impurity")

Question

In terms of meaningful summaries - this description of Comonads seems to be winning - describing them as a "type of input impurity."

What is the equivalent meaningful (one sentence) description for codata?

Answer 1

"Codata are types populated by values ​​that can be infinite."

This contrasts with the “data”, which are populated only by finite values. For example, if we take the definition of “data” of lists, it is populated with lists of finite length (as in ML), but if we take the definition of “codata”, it will be populated as infinite (as in Haskell, for example x = 1 : x ).

Komonads and codates are not necessarily related (although perhaps some may think of this because of the article by Kiburz Comonads and codata in Haskell ).