Make uPred itself independent of BI interface and just prove primitive laws (like in master branch)
The BI interface is then instantiated using these laws. In particular, this shows that the rules we claim to be admissible actually are.
Showing
- _CoqProject 2 additions, 0 deletions_CoqProject
- theories/base_logic/base_logic.v 1 addition, 2 deletionstheories/base_logic/base_logic.v
- theories/base_logic/bi.v 150 additions, 0 deletionstheories/base_logic/bi.v
- theories/base_logic/derived.v 65 additions, 3 deletionstheories/base_logic/derived.v
- theories/base_logic/lib/own.v 2 additions, 2 deletionstheories/base_logic/lib/own.v
- theories/base_logic/upred.v 403 additions, 325 deletionstheories/base_logic/upred.v
- theories/bi/derived_connectives.v 10 additions, 21 deletionstheories/bi/derived_connectives.v
- theories/bi/derived_laws_bi.v 1 addition, 1 deletiontheories/bi/derived_laws_bi.v
- theories/bi/interface.v 3 additions, 16 deletionstheories/bi/interface.v
- theories/bi/notation.v 45 additions, 0 deletionstheories/bi/notation.v
- theories/bi/plainly.v 3 additions, 6 deletionstheories/bi/plainly.v
- theories/bi/updates.v 3 additions, 6 deletionstheories/bi/updates.v
- theories/proofmode/class_instances_sbi.v 1 addition, 1 deletiontheories/proofmode/class_instances_sbi.v
Loading
Please register or sign in to comment