[MLton-user] Mutual recursion?

[Andreas Rossberg]

"Wesley W. Terpstra" <wesley at terpstra.ca> wrote:
>> No, a recursive reference is not polymorphic -- because type inference is
>> generally undecidable for polymorphic recursion.
>
> I see. I imagine that if I provide an explicit (polymorphic) type
> binding for each function, SML will be happy?

No, that won't help. For the sake of simplicity and uniformity, ML chooses 
not to treat type annotations in recursive bindings specially. There is no 
polymorphic recursion in SML, with or without annotations.

- Andreas