12 Jul
2007
12 Jul
'07
2:36 p.m.
Stefan Holdermans wrote:
In Haskell, coinductive types and inductive types coincide. So, Haskell's [] models both lists and colists.
In what sense do they coincide? Inductive lists are a subset of coinductive ones but that's not Haskell-specific. In fact, I can perfectly well define inductive lists in Haskell: data IList a = Nil | Cons a !(IList a) Roman