[Coq] rewrite tactic for cyclic notations

ComputerAidedLL / click-and-collect

A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml

GNU Lesser General Public License v2.1

17 stars 2 forks source link

Closed olaure01 closed 3 years ago

olaure01 commented 3 years ago

Avoid complexity problem with rewrite at in presence of Yalla.

etiennecallies commented 3 years ago

Ok 👍🏻