I've defined a notation to simulate imperative style programming by
Notation "a >> b" := (b a) (at level 50).
However after that, all function-application expression are represented as '>>' style. For example, in proof mode of Coq Toplevel, I can see
bs' : nat >> list
while actually it should be
bs' : list nat
Why does Coq aggressively rewrite all function application styled expression into my customized '>>' representation? How can I restore everything back to normal, I mean I want to see 'a >> b' be interpreted as 'b a' and 'list nat' will not be represented as 'nat >> list'?
Thank you!