Re: [Caml-list] Cyclic type abbreviation

[peterfrey <pjfrey@sympatico.ca>]

Interestingly, this definition is accepted:
>
> type tree = (int * 'a * 'a) option as 'a
>
> Here you are helping the type-checker because you give it a 
> "canonical" representation that it can use when unifying; it no longer 
> has to expand the type, potentially infinitely. I think the main point 
> is that the type is isorecursive, but I'm not really an expert on the 
> subject.
>
with this type-checking business I sometimes have the feel being Alice 
in Wonderland; its getting curiouser and curiouser ...

The type : type node = int * tree * tree  and tree = node option is, in 
fact, accepted if you use the -rectypes option.
I just checked it with utop -rectypes

I wonder if this is considered bad (dangerous) style; but there are 
several things that would not work for me without this option.

Peter Frey