> The problem with advanced type inference is that the exact algorithm needs to be part of the standard for compability reasons
I don't think that's true -- if you have principal types, you can just say in your language spec that the principal type is inferred.
Re:Type inference
by lifthrasiir on Friday November 16, 2018 @01:15AM
(#18466849)
It can be really tedious to list the cases where principal types do not exist. Haskell has a separate section for ambiguous overloading [1] for that reason, and more ad-hoc or advanced type systems will be harder to describe.
[1] https://www.haskell.org/onlinereport/haskell2010/haskellch4....
So for me it makes more sense to have everything that’s beyond basic in something like a lsp-language server/ide.