adding [Funext-comp-rules.v], a discussion of computation rules for functional extensionality.
Folding content of [Funext-comp-rules.v] into [Funext.v].
Removing [Funext-comp-rules.v].
Personalising readme.
Added statement of [contr_funext], and proof of it from [funext_dep].
Merge branch 'master' of github.com:peterlefanulumsdaine/HoTT
Trying to understand Ltac second-order pattern-matching
Joining the dots from naive to strong funext.
Fixing breakage in prev commit
Major reorganisation of Funext.v
Adding archive copy of blog post menagerie.html
Adding derivation(s) of dependent from non-dependent W-types.
Renaming to w-to-inductive.v to make use of builtin equality explicit.
Starting on fetooling of w-to-inductive.v without rewrite; ack, it’s painful.
Minor correction to previous commit.
Some proofs in Paths.v are just by reflexivity and used the
path_induction sledgehammer.
Playing with the arguments of the definitions in Paths.v, work in progress.

- More implicit arguments to ease the subsequent use of the lemmas (avoiding
as much as possible apply (my_lemma _ _ _ f _ _))

- Using the 'apply my_lemma with (x := _)' is really to robust: it is
  affected by alpha-conversion in the statement of the lemma an
  modification of the status of arguments as implicits. It is way more
  robust to adjust the order of the arguments in my_lemma so that
  partial applications become easier. For instance put first the argument
  that is not present in the conclusion of a lemma :e.g. a
  transitivity lemma should be stated:
  forall y x z, x = y -> y = z -> x = z
  The man in the middle (y) comes first because it cannot be infered
  from the user goal.
Merge remote-tracking branch 'upstream/master'
Added some hints on how to change the PG prog name.
Trying to improve the script where the matching algo used by Coq rewrite
tactic does not behave well.