title: The type system in Scala is Turing complete. Proof? Example? Benefits?
body: <p>There are claims that Scala's type system is Turing complete. My questions are:</p>
  
  <ol>
  <li><p>Is there a formal proof for this?</p></li>
  <li><p>How would a simple computation look like in the Scala type system?</p></li>
  <li><p>Is this of any benefit to Scala - the language? Is this making Scala more "powerful" in some way compared languages without a Turing complete type system?</p></li>
  </ol>
  
  <p>I guess this applies to languages and type systems in general.</p>