[Haskell] recursive definitions in Haskell (inductive and
nr at cs.tufts.edu
Tue Feb 2 20:41:52 EST 2010
> AFAIK, the normal understanding is that recursive types
> are the least fixed points of endofunctors on the category of CPOs,
> and it is the CPO property that least upper bounds of chains exist
> that forces the existence of infinite lists.
But ML has CPOs and infinite chains too! The situation is simpler
because the only *interesting* infinite ascending chains are in
To paraphrase, is what you're saying that the definition of a Haskell
type is the smallest fixed point that contains the bottom element
(divergent computation) as a member?
More information about the Haskell