Remove notations for bi_bare and bi_persistently.
(□ P) now means (bi_bare (bi_persistently P)). This is motivated by the fact that these two modalities are rarely used separately. In the case of an affine BI, we keep the □ notation. This means that a bi_bare is inserted each time we use □. Hence, a few adaptations need to be done in the proof mode class instances.
Showing
- theories/base_logic/derived.v 9 additions, 7 deletionstheories/base_logic/derived.v
- theories/base_logic/lib/viewshifts.v 4 additions, 1 deletiontheories/base_logic/lib/viewshifts.v
- theories/base_logic/upred.v 13 additions, 11 deletionstheories/base_logic/upred.v
- theories/bi/big_op.v 15 additions, 11 deletionstheories/bi/big_op.v
- theories/bi/derived.v 190 additions, 151 deletionstheories/bi/derived.v
- theories/bi/fixpoint.v 6 additions, 6 deletionstheories/bi/fixpoint.v
- theories/bi/interface.v 27 additions, 21 deletionstheories/bi/interface.v
- theories/program_logic/hoare.v 1 addition, 1 deletiontheories/program_logic/hoare.v
- theories/proofmode/class_instances.v 84 additions, 61 deletionstheories/proofmode/class_instances.v
- theories/proofmode/classes.v 8 additions, 8 deletionstheories/proofmode/classes.v
- theories/proofmode/coq_tactics.v 43 additions, 40 deletionstheories/proofmode/coq_tactics.v
- theories/proofmode/tactics.v 4 additions, 4 deletionstheories/proofmode/tactics.v
- theories/tests/proofmode.v 17 additions, 15 deletionstheories/tests/proofmode.v
Loading
Please register or sign in to comment