induction schemas are non-reductive and local, at schema level. On the other hand, the
implicit induction methods used by automated theorem provers allow for lazy and mutual
induction reasoning. In this paper, we present a new tactic for the Coq proof assistant able to
perform automatically implicit induction reasoning. By using an automatic black-box
approach, conjectures intended to be manually proved by the certifying proof environment …