Add matching on non-inductive types in building an inversion problem for finding the initial predicate, since their type can be dependent on previous terms to match and they may have to be generalized.
Add matching on non-inductive types in building an inversion problem
for finding the initial predicate, since their type can be dependent
on previous terms to match and they may have to be generalized.

git-svn-id: 44dc50bdcc0f5d1a212c497508dc9452e0b35e2b@14710 85f007b7-540e-0410-9357-904b9bb8a0f7

mattam82/coq,letouzey/coq-wip,coq/coq,maximedenes/coq,ppedrot/coq,amintimany/coq,ale-f/coq,gmalecha/coq,Zimmi48/coq,TOSPIO/coq,mlasson/coq,pirapira/coq2rust,jpdeplaix/coq,gares/coq,jhjourdan/coq,pirbo/coq,Matafou/coq,asr/coq,maximedenes/coq,ejgallego/coq,amintimany/coq,ale-f/coq,TheTypoMaster/coq,SkySkimmer/coq,barras/coq,ppedrot/coq,jhjourdan/coq,JasonGross/coq,SkySkimmer/coq,maximedenes/coq,letouzey/coq-wip,Matafou/coq,aspiwack/coq,Zimmi48/coq,8l/coq,gares/coq,silene/coq,ejgallego/coq,mlasson/coq,ejgallego/coq,shindere/coq,TheTypoMaster/coq,Lionel-Rieg/coq,gares/coq,ppedrot/coq,aspiwack/coq,jhjourdan/coq,gares/coq,mlasson/coq,coq/coq,TOSPIO/coq,JasonGross/coq,Matafou/coq,gares/coq,jpdeplaix/coq,ppedrot/coq,letouzey/coq-wip,silene/coq,gmalecha/coq,8l/coq,coq/coq,william-lawvere/coq,letouzey/coq-wip,herbelin/github-coq,coq/coq,william-lawvere/coq,barras/coq,Lionel-Rieg/coq,herbelin/github-coq,shindere/coq,JasonGross/coq,jpdeplaix/coq,pirapira/coq2rust,mattam82/coq,Ptival/coq,maximedenes/coq,Zimmi48/coq,ppedrot/coq,pirbo/coq,herbelin/github-coq,gmalecha/coq,asr/coq,pirapira/coq2rust,Ptival/coq,william-lawvere/coq,SkySkimmer/coq,SkySkimmer/coq,letouzey/coq-wip,maximedenes/coq,silene/coq,ejgallego/coq,shindere/coq,amintimany/coq,TheTypoMaster/coq,asr/coq,JasonGross/coq,barras/coq,Lionel-Rieg/coq,Ptival/coq,TOSPIO/coq,Zimmi48/coq,8l/coq,mattam82/coq,ale-f/coq,pirbo/coq,aspiwack/coq