Prove the eta rule for sigmas from a more general prinicple

Also, rename it to half_eta, because it says
  match u as u' return P u' with
    | (a; b) => (a; b)
  end
  ==
  u
rather than
  (match u as u' return A with
     | (a; b) => a
   end;
   match u as u' return P (match u' with (a; b) => a end) with
     | (a; b) => b
   end)
  ==
  u
which is the proper eta rule.  (More concisely, this is (u.1; u.2) == u.)
Jason's pull requests.
Merge branch 'master' of https://github.com/andrejbauer/tt
equal_whnf_ty wasn't being called! 2x speedup

Conflicts:
	brazil/equal.ml
Sped up debug printing of patterns, a lot
Alpha-equivalence respects magenta
Brazil/syntax.ml uses the mkZZZ fns
Optimize shifting by zero
typing.ml uses the mkZZZ fns
equal.ml uses mkZZZ, but not spines
Deleted remnants of spines from Pattern
3x speedup by a fail-fast in pattern-matching apps
Fixed ordering bug in desugaring of J type family
Better Input-to-string conversion
Fixed further J-ordering bugs
Add a list example

I would like to know if the non-dependent recursive, and dependent
non-recursive, commutativity rules for lists can be combined into a
single dependent recursive commutativity rule.
Remove a false parameter, add a recursive half-eta rule

I, uh, neglected to sanity check my type-checking-but-non-dependent
commutation rule.