title: What limits does scala place on the "acceptable complexity" of inferred types?
body: <p>According to the <a href="http://www.scala-lang.org/docu/files/ScalaReference.pdf#page58" rel="noreferrer">Scala Language Spec</a>:</p>
  
  <blockquote>
    <p>... local type inference is permitted to limit the complexity of inferred
    bounds [of type parameters]. Minimality and maximality of types have to be understood
    relative to the set of types of acceptable complexity.</p>
  </blockquote>
  
  <p>In practice what are the limits? </p>
  
  <p>Also, are there different limits that apply to inferred expression types than to parameter type bounds, and what are those limits?</p>