An example of Coq plugin that provides a tactic that generalize the modus-ponens rule. That is, given H: A -> B -> C -> D =================== G exploit H requires the user to prove A, B and C, and the fact that D -> G.
braibant/exploit-plugin
An OCaml version of the LTac "exploit" tactic, used as a tutorial for writing Coq plugins
CoqNOASSERTION