Keeping information when using induction?

I am using the Coq Proof Assistant to implement a model of a (small) programming language (extending an implementation of Featherweight Java by Bruno De Fraine, Erik Ernst, Mario Südholt). One thing …

How to disable my custom notation in Coq?

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 ‘>>’ …