<p>
Type inference solves type equations through <i>type unification</i>.
Type unification recursively compares the LHS and RHS types of an
equation, where either or both types may be or contain bound type parameters,
and looks for type arguments for those type parameters such that the LHS
and RHS match (become identical or assignment-compatible, depending on
context).

    <sub-class-of type="text/plain"/>
  </mime-type>

  <mime-type type="text/x-haskell">
    <_comment>Haskell source code</_comment>
    <glob pattern="*.hs"/>
    <glob pattern="*.lhs"/>
    <sub-class-of type="text/plain"/>
  </mime-type>

  <mime-type type="text/x-idl">
    <_comment>Interface Definition Language</_comment>
    <glob pattern="*.idl"/>