Stack overflow with polymorphic recursion

[lukechu10]

The following code currently produces a stack overflow:

type Foo a = | FooA a
let f x = f (FooA x)

Polymorphic recursion is generally not allowed is other languages because it makes type inference undecidable. I'm guessing the stack overflow is because it's not possible to unify the type of f here?

[Marwes]

Yeah, that should be an error just that the error isn't detected (might have had detection for it, but I guess I broke it in that case)