As I understand it, polymorphic recursive functions require type
annotations because inferring their types is undecidable in the general
case.


On Fri, Feb 22, 2013 at 1:06 PM, Leo White <lpw25@cam.ac.uk> wrote:

> I would like to ask:
>>
>> - Where is that restriction explained?
>>   (I've searched Ocaml reference manual for "monomorphic" but nothing
>>    relevant seemed to come up)
>>
>> - Where are things like:
>>
>>      'a. 'a -> unit
>>
>>   described?
>>
>>
> I'm not sure if the restriction is explained anywhere but the solution is
> described in:
>
>  http://caml.inria.fr/pub/docs/**manual-ocaml-4.00/manual021.**html#toc79<http://caml.inria.fr/pub/docs/manual-ocaml-4.00/manual021.html#toc79>
>
> Regards,
>
> Leo
>
>
> --
> Caml-list mailing list.  Subscription management and archives:
> https://sympa.inria.fr/sympa/**arc/caml-list<https://sympa.inria.fr/sympa/arc/caml-list>
> Beginner's list: http://groups.yahoo.com/group/**ocaml_beginners<http://groups.yahoo.com/group/ocaml_beginners>
> Bug reports: http://caml.inria.fr/bin/caml-**bugs<http://caml.inria.fr/bin/caml-bugs>
>