Re: [Haskell] recursive definitions in Haskell (inductive and coinductive)

[Norman Ramsey]

 > 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
function domains.

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?


Norman
_______________________________________________
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell