Idea: Reverse Type Inference

[Guillaume Boucher via Digitalmars-d]

On Monday, 22 May 2017 at 13:20:41 UTC, Stefan Koch wrote:
> type inference is not magic, it's a search for a pattern over 
> the syntax (sub)tree.
> Hence it can have quadratic time/memory complexity.

Well, the type system of Scala is turing complete, hence it can 
take arbitrarily long:
https://michid.wordpress.com/2010/01/29/scala-type-level-encoding-of-the-ski-calculus/