> > I also think its neat that you seem to have found a use for cyclic
> > unification. This is definitely an impetus to extend the language to
> > include cyclic types. (I don't expect we'll do this for a while
> > though. You might consider modifying the Glasgow Haskell compiler to
> > include this yourself -- it may not be too difficult.)
>
> I'm not sure with it's possible to do this with the substitution
> algorithm used in our compiler, I thought the occurs check helped
> preserve the idempotency of substitions? It's certainly possible in
I thought there were problems with extending Hindley-Milner type systems
with cyclic types: The type inference can handle type correct programs,
but will loop for certain type incorrect programs, or am I mistaken?
-- Lennart
